By Topic

An analysis of Chen's construction of minimum-distance five codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Batten, L.M. ; Dept. of Math., Manitoba Univ., Winnipeg, Man., Canada ; Davidson, M. ; Storme, L.

In 1991, C.L. Chen used the inverted construction Y1 on binary linear codes of minimum Hamming distance five to construct a new [47, 36, 5] code. We examine this construction in depth and show that no such codes are obtained unless the fields GF(8) or GF(32) are used. Using MAGMA, we prove that the binary [11, 4, 5] code and the binary [15, 7, 5] extension found by Chen are the only possible such codes using the field GF(8); indeed, the latter is a Bose-Chaudhuri-Hocquenghem (BCH) code. We prove also that, using the field GF(32), precisely three nonequivalent binary [47, 36, 5] codes arise along with one extension to a [63, 51, 5] code

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 2 )