Communications - Scientific Letters of the University of Zilina 2000, 2(2):61-63 | DOI: 10.26552/com.C.2000.2.61-63

Two new best [27,10,9 ] codes

Peter Farkas1, Sergio Herrera-Garcia2
1 Department of Telecommunications, Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Slovak Republic
2 CITEDI-IPN Research Center and CONACyT, San Diego, CA, USA

This paper presents two new [27,10,9] binary linear block codes which reach the upper bound in [1] for best known codes. They have different spectra as the known [27,10,9] codes constructed by Piret [2], Farkaš and Juling [5].

Keywords: block codes, Hamming distance, weight spectrum, generator matrix

Published: June 30, 2000  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Farkas, P., & Herrera-Garcia, S. (2000). Two new best [27,10,9 ] codes. Communications - Scientific Letters of the University of Zilina2(2), 61-63. doi: 10.26552/com.C.2000.2.61-63
Download citation

References

  1. BROUWER, A. E., VERHOEFF, T.: An Updated Table of Minimum - Distance Bounds for Binary Linear Code. In: IEEE Trans. Inform. Theory, IT-39, 1993, no. 2, pp. 662-677. Go to original source...
  2. PIRET, P.: Good linear codes of lengths 27 and 28. In: IEEE Trans. on Inform. Theory, IT-26, 1980, pp. 227. Go to original source...
  3. FARKAŠ, P., SMIRNOV, A. S., SOTSKOV, J. V.: Lineárne kódy opravujúce mnohonásobné chyby. In: Informačné systémy, vol. 14, 1986, no. 5, pp. 533-542.
  4. FARKAŠ, P., BRUEHL, K.: Three Best Binary Linear Block Codes of Minimum Distance Fifteen. In: IEEE Trans. on Inform. Theory, IT-40, 1994, no. 3, pp. 949-951. Go to original source...
  5. FARKAŠ, P, JULING W.: Five New Best [27,10,9] Codes. In: International Journal of Electronics and Communications, (AEU), vol. 48, 1994, no. 2, pp. 115-116.

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.