On t-Error Correcting/All Unidirectional Error Detecting Codes
IEEE Transactions on Computers
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
New Techniques for Constructing EC/AUED Codes
IEEE Transactions on Computers
Optimal disk allocation for partial match queries
ACM Transactions on Database Systems (TODS)
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Singly-Even Self-Dual Codes of Length 40
Designs, Codes and Cryptography
Split Orthogonal Arrays and Maximum Independent ResilientSystems of Functions
Designs, Codes and Cryptography
Designs, Codes and Cryptography
A Systematic (16,8) Code for Correcting Double Errors and Detecting Triple-Adjacent Errors
IEEE Transactions on Computers
Constructions of the SbEC-DbED and DbEC codes, and their applications
DFT '95 Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems
Upper Bounds on the Dual Distance of BCH(255, k)
Designs, Codes and Cryptography
Iterated local search and constructive heuristics for error correcting code design
International Journal of Innovative Computing and Applications
| Hi-index | 754.84 |
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.