On a family of binary completely transitive codes with growing covering radius

Josep Rifà, Victor A. Zinoviev

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes with d=3, covering radius ρ and length (4ρ2) and (4ρ+22), respectively. These new completely transitive codes induce, as coset graphs, a family of distance-transitive graphs of growing diameter. © 2013 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)48-52
JournalDiscrete Mathematics
Volume318
Issue number1
DOIs
Publication statusPublished - 6 Mar 2014

Keywords

  • Combinatorial codes
  • Completely regular codes
  • Completely transitive codes
  • Distance-transitive graphs

Fingerprint

Dive into the research topics of 'On a family of binary completely transitive codes with growing covering radius'. Together they form a unique fingerprint.

Cite this