By Topic

Bounds on the Minimum Homogeneous Distance of the pr-ary Image of Linear Block Codes Over the Galois Ring GR(pr,m)

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

2 Author(s)
Sole, P. ; CNRS, Sophia Antipolis ; Sison, Virgilio

In this correspondence, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(pr,m), with respect to any basis of GR(pr,m). These bounds depend on the parameters of GR(pr ,m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zopf p r. Examples are given of Galois ring codes that meet these bounds

Published in:

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