New [48,16,16] Optimal Linear Binary Block Code

2009/12/21 by Axel Kohnert, Kohnert, Axel
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0912.4107

arxiv created 2009/12/21 · arxiv updated 2010/01/14

Abstract

A new [48,16,16] optimal linear binary block code is given. To get this code a general construction is used which is also described in this paper. The construction of this new code settles an conjecture mentioned in a 2008 paper by Janosov et al. where the authors found an new optimal [47,15,16]-code, which is relevant to the applied construction.

Related

• On Optimal Finite-length Block Codes of Size Four for Binary Symmetric Channels
• Projection decoding of some binary optimal linear codes of lengths 36 and 40
• New upper bounds on binary linear codes and a \mathbb Z₄-code with a better-than-linear Gray image
• One more proof of the first linear programming bound for binary codes and two conjectures
• Binary optimal linear codes from posets of the disjoint union of two chains