CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A table of upper bounds for binary codes

Erik Agrell (Institutionen för signaler och system, Kommunikationssystem ; Extern) ; Alexander Vardy ; Kenneth Zeger
IEEE Transactions on Information Theory (0018-9448 ). Vol. 47 (2001), 7, p. 3004-3006.
[Artikel, refereegranskad vetenskaplig]

Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish four new bounds on A(n, d), namely, A(21, 4)⩽43689, A(22, 4)⩽87378, A(22, 6)⩽6941, and A(23, 4)⩽173491. Furthermore, using previous upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on A(n, d) for all n⩽28. This table extends the range of parameters compared with previously known tables.

Nyckelord: error-control

Denna post skapades 2006-09-12. Senast ändrad 2016-04-28.
CPL Pubid: 14987


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Kommunikationssystem (1900-2017)


Information Technology

Chalmers infrastruktur