Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Theory

Upper bounds on codes correcting asymmetric errors (Corresp.)

Torleiv Kløve

Published Jan 1, 1981• 35 citations
Publisher

Abstract

A Survey is given of known upper bounds on codes correcting asymmetric errors. The bounds are improved by introducing new Ideas. By solving a linear programming problem an upper bound is given that is easy to compute for all codelengths and all minimum asymmetric distances.
DOI
10.1109/tit.1981.1056291

Related papers

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

T Tom Verhoeff

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.

IEEE Transactions on Information Theory•Sep 1, 1987•289 citations

An upper bound on the error correction ability of codes (Corresp.)

J. Bartow

IEEE Transactions on Information Theory•Oct 1, 1963•1 citation

A reduced upper bound on the error correction ability of codes (Corresp.)

J. Bartow

IEEE Transactions on Information Theory•Jan 1, 1963•3 citations

Upper bounds on the rate of LDPC codes as a function of minimum distance

Yael Ben‐Haim, Simon N. Litsyn

New upper bounds on the rate of low-density parity-check (LDPC) codes as a function of the minimum distance of the code are derived. These bounds are based on combinatorial arguments and linear programming. They improve on the previous bounds due to Burshtein et al. It is proved that at least for high rate LDPC codes have worse relative minimum distance than the one guaranteed by the Gilbert-Varshamov bound

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•3 citations

Bounds and constructions for binary block codes correcting asymmetric or unidirectional errors

Jos H. Weber

•Nov 23, 1989•14 citations

Bounds on the worst case probability of undetected error

Torleiv Kløve

Upper and lower bounds on the average worst-case probability of undetected error for linear [n,k,q] codes are given.>

IEEE Transactions on Information Theory•Jan 1, 1995•10 citations
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.