By Topic

On minimum Lee weights of Hensel lifts of some binary BCH 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

1 Author(s)
Hao Chen ; Dept. of Math., Zhongshan Univ., Guangzhou, China

Motivated by the paper of Calderbank, McGuire, Kumar, and Helleseth (see ibid., vol.42, no.1, p.217-26, Jan. 1996) we prove the following result: for any given positive integer l⩾3, the minimum Lee weights of Hensel lifts (to Z4) of binary primitive BCH codes of length 2m-1 and designed distance 2l-1 is just 2l-1 when (a) m can be divided by l or (b) m is sufficiently large. For Hensel lifts of binary primitive BCH codes of arbitrary designed distance δ⩾4, we also prove that their minimum Lee weight dL⩽2([log2δ]+1)-1 when m is sufficiently large. Moreover, a result about minimum Lee weights of certain Z4 codes defined by Galois rings, which is similar to the result in Calderbank et al., is proved

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 6 )