liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A Family of Ternary Quasi-Perfect BCH Codes
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
Bulgarian Academy of Sciences.
2008 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, Vol. 49, 265-271 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.

Place, publisher, year, edition, pages
2008. Vol. 49, 265-271 p.
Keyword [en]
Quasi-perfect codes, packing radius, covering radius, algebraic decoding
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-21803DOI: 10.1007/s10623-008-9193-7OAI: diva2:241744
The original publication is available at Danyo Danev and Stefan Dodunekov, A Family of Ternary Quasi-Perfect BCH Codes, 2008, Designs, Codes and Cryptography, (49), 265-271. Copyright: Springer Science Business Media Available from: 2009-10-05 Created: 2009-10-05 Last updated: 2010-01-20

Open Access in DiVA

No full text

Other links

Publisher's full textA Family of Ternary Quasi-Perfect BCH Codes

Search in DiVA

By author/editor
Danev, Danyo
By organisation
Communication SystemsThe Institute of Technology
In the same journal
Designs, Codes and Cryptography
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 899 hits
ReferencesLink to record
Permanent link

Direct link