Journal Article10.1109/18.50400
On a new binary (22,13,5) code
Zhi Chen,Pingzhi Fan,Fan Jin +2 more
2
TL;DR: Four lower bounds for constant weight codes can be derived from a new binary (22,13,5) quasi-perfect code, which are better than the codes with the same parameters in R.L. Graham and N.J. Sloane (1980) and A.E. Brouwer et al. (1980).
read more
Abstract: A new binary (22,13,5) quasi-perfect code is presented. The weight distributions of the coset codes are given. The code obtained is not equivalent to T.J. Wagner's code (1966). Four lower bounds for constant weight codes can be derived from it, which are better than the codes with the same parameters in R.L. Graham and N.J. Sloane (1980) and A.E. Brouwer et al. (1980). >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A new table of constant weight codes
TL;DR: The known techniques for constructing constant weight codes are surveyed, and a table of (unrestricted) binary codes of length nl28 is given.
References
Lower bounds for constant weight codes
Ron Graham,Neil J. A. Sloane +1 more
TL;DR: Several lower bounds for A(n,2\delta,w) are given, better than the "Gilbert bound" in most cases.
327
A search technique for quasi-perfect codes
TL;DR: Using the properties of parity-check matrices of binary linear codes a tree-search program is given which finds quasi-perfect codes and yielded eighteen new quasi- perfect double error-correcting codes.
39
On the (23,14,5) Wagner code (Corresp.)
TL;DR: This work looked for all [11,4,4] codes containing 35 words and found that 11 nonequivalent codes with these parameters exist.
8