A Bound for Error-Correcting Codes


This paper gives two new bounds for the code word length n which is required to obtain CI blnary group code of order 2k with mutual distance c/ between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and c/. Values of k and c/ are given for which one of these bounds can actually… (More)
DOI: 10.1147/rd.45.0532


3 Figures and Tables

Slides referencing similar topics