A symmetric Roos bound for linear codes

I.M. Duursma, G.R. Pellikaan

Research output: Contribution to journalArticleAcademicpeer-review

10 Citations (Scopus)
1 Downloads (Pure)

Abstract

The van Lint–Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound to prove the actual minimum distance for a class of dual BCH codes of length q2-1 over . We give cyclic codes [63,38,16] and [65,40,16] over that are better than the known [63,38,15] and [65,40,15] codes.
Original languageEnglish
Pages (from-to)1677-1688
JournalJournal of Combinatorial Theory, Series A
Volume113
Issue number8
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'A symmetric Roos bound for linear codes'. Together they form a unique fingerprint.

Cite this