Classification of Binary Constant Weight Codes

A binary code C ⊆ F 2 n with minimum distance at least d and codewords of Hamming weight w is called an (n , d , w ) constant weight code. The maximum size of an (n , d , w ) constant weight code is denoted by A ( n , d , w ), and codes of this size are said to be optimal. In a computer-aided approa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2010-08, Vol.56 (8), p.3779-3785
1. Verfasser:	Ostergard, P R J
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary codes Classification code equivalence Codes constant weight code Counting double counting Electronic mail Hamming distance Hamming weight Information theory Johnson bound Optimization Symbols Upper bound Upper bounds
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!