By Topic

Decoding of linear codes over Galois rings

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)
Babu, N.S. ; Dept. of Electr. & Comput. Eng., Tech. Univ. Hamburg-Harburg, Germany ; Zimmermann, K.-H.

We present a method for decoding an arbitrary linear code over a Galois ring ℛ by a process of lifting decoding algorithms for a family of linear codes over a finite field 𝒦 forming an α-element chain, where 𝒦 is the quotient field of ℛ and ℛ has characteristic pα. As a new result, this method also works for linear codes over ℛ which are nonfree ℛ-modules

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 4 )