Contents

Ars Combinatoria

  • Research article

Optimal Binary Linear Codes Containing the \([6, 5, 2] \otimes [3, 1,3]\) Product Code

M. Esmaeili1, M.R. Yazdani2, T.A. Gulliver3
1Department of Mathematical Sciences Isfahan University of Technology, Isfahan, Iran
2Dept. of Systems and Computer Engineering Carleton University, Ottawa, Canada
3Dept. of Electrical and Computer Engineering University of Victoria, P.O. Box 3055, STN CSC Victoria, B.C., Canada V8W 3P6
  • Published: 30/04/2005

Abstract

Optimal binary linear codes of length \(18\) containing the \([6, 5, 2]\otimes[ 3, 1, 3]\) product code are presented. It is shown that these are \([18, 9, 5]\) and \([18, 8, 6]\) codes. The soft-decision maximum-likelihood decoding complexity of these codes is determined. From this point of view, these codes are better than the \([18, 9, 6]\) code.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
M. Esmaeili, M.R. Yazdani, T.A. Gulliver. Optimal Binary Linear Codes Containing the \([6, 5, 2] \otimes [3, 1,3]\) Product Code[J], Ars Combinatoria, Volume 075. 3-11. .