A new binary code of length 16 and minimum distance 3

A new binary code of length 16 and minimum distance 3

We describe a binary (16,2816,3) code and therefore show A(16,3)≥2816. This improves on the previously known bound A(16,3)≥2720. •We find by computer search a suitable (9,176,2) binary code.•The above code can be partitioned into 8 subcodes with minimum distance 3.•Using this code we construct a (16...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2015-12, Vol.115 (12), p.975-976
1. Verfasser: Milshtein, Moshe
Format: Artikel
Sprache:eng
Schlagworte:
Binary code
Block code
Codes
Coding theory
Combinatorial problems
Computer science
Hamming distance
Lower bound
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We describe a binary (16,2816,3) code and therefore show A(16,3)≥2816. This improves on the previously known bound A(16,3)≥2720. •We find by computer search a suitable (9,176,2) binary code.•The above code can be partitioned into 8 subcodes with minimum distance 3.•Using this code we construct a (16,2816,3) binary code.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2015.07.001