Contents

Ars Combinatoria

  • Research article

Improvements to the Bounds on Optimal Binary Linear Codes of Dimensions \(11\) and \(12\)

T.Aaron Gulliver1, Vijay K.Bhargava2
1 Department of Electrical and Electronic Engineering University of Canterbury Christchurch, New Zealand
2 Department of Electrical and Computer Engineering University of Victoria P.O. Box 3055, MS 8610, Victoria, BC, Canada V8W 3P6
  • Published: 31/12/1996

Abstract

Eight new codes are presented which improve the bounds on maximum minimum distance for binary linear codes. They are rate \(\frac{m-r}{pm},r\geq 1\) , \(r\)-degenerate quasi-cyclic codes.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
T.Aaron Gulliver, Vijay K.Bhargava. Improvements to the Bounds on Optimal Binary Linear Codes of Dimensions \(11\) and \(12\)[J], Ars Combinatoria, Volume 044. 173-181. DOI: .