On the performance of optimal double circulant even codes

T. Aaron Gulliver, Masaaki Harada

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To achieve this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to 72. We also give some restrictions on the weight distributions of (extremal) self-dual [54; 27; 10] codes with shadows of minimum weight 3. Finally, we consider the performance of extremal self-dual codes of lengths 88 and 112.

Original languageEnglish
Pages (from-to)767-775
Number of pages9
JournalAdvances in Mathematics of Communications
Volume11
Issue number4
DOIs
Publication statusPublished - 2017 Nov

Keywords

  • Decoding error probability
  • Double circulant code
  • Self-dual code
  • Weight distribution

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On the performance of optimal double circulant even codes'. Together they form a unique fingerprint.

  • Cite this