An updated table of minimum-distance bounds for binary linear codes

T. Verhoeff

doi:10.1109/TIT.1987.1057356

An updated table of minimum-distance bounds for binary linear codes

T. Verhoeff

Algorithms

Research output: Contribution to journal › Article › Academic › peer-review

109 Citations (Scopus)

Abstract

In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-distance for binary linear error-correcting codes up to length127. This article presents an updated table incorporating numerous improvements that have appeared since then. To simplify the updating task the author has developed a computer program that systematically investigates the consequences of each improvement by applying several well-known general code-construction techniques. This program also made it possible to check the original table. Furthermore, it offers a quick and reliable update service for future improvements.

Original language	English
Pages (from-to)	665-680
Number of pages	16
Journal	IEEE Transactions on Information Theory
Volume	33
Issue number	4
DOIs	https://doi.org/10.1109/TIT.1987.1057356
Publication status	Published - 1987

Access to Document

10.1109/TIT.1987.1057356

Cite this

@article{039ed966274e4edd866375645aa384a6,

title = "An updated table of minimum-distance bounds for binary linear codes",

abstract = "In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-distance for binary linear error-correcting codes up to length127. This article presents an updated table incorporating numerous improvements that have appeared since then. To simplify the updating task the author has developed a computer program that systematically investigates the consequences of each improvement by applying several well-known general code-construction techniques. This program also made it possible to check the original table. Furthermore, it offers a quick and reliable update service for future improvements.",

author = "T. Verhoeff",

year = "1987",

doi = "10.1109/TIT.1987.1057356",

language = "English",

volume = "33",

pages = "665--680",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "4",

}

TY - JOUR

T1 - An updated table of minimum-distance bounds for binary linear codes

AU - Verhoeff, T.

PY - 1987

Y1 - 1987

N2 - In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-distance for binary linear error-correcting codes up to length127. This article presents an updated table incorporating numerous improvements that have appeared since then. To simplify the updating task the author has developed a computer program that systematically investigates the consequences of each improvement by applying several well-known general code-construction techniques. This program also made it possible to check the original table. Furthermore, it offers a quick and reliable update service for future improvements.

AB - In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-distance for binary linear error-correcting codes up to length127. This article presents an updated table incorporating numerous improvements that have appeared since then. To simplify the updating task the author has developed a computer program that systematically investigates the consequences of each improvement by applying several well-known general code-construction techniques. This program also made it possible to check the original table. Furthermore, it offers a quick and reliable update service for future improvements.

U2 - 10.1109/TIT.1987.1057356

DO - 10.1109/TIT.1987.1057356

M3 - Article

SN - 0018-9448

VL - 33

SP - 665

EP - 680

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

ER -

An updated table of minimum-distance bounds for binary linear codes

Abstract

Access to Document

Fingerprint

Cite this