Implementing gradient descent decoding
Robert Liebler
Source: Michigan Math. J. Volume 58, Issue 1 (2009), 285-291.
Primary Subjects: 94B35
Secondary Subjects: 49M99
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.mmj/1242071693
Digital Object Identifier: doi:10.1307/mmj/1242071693
Mathematical Reviews number (MathSciNet):
MR2526088
Zentralblatt MATH identifier:
1169.94017
References
E. Agrell, Voronoi regions for binary linear block codes, IEEE Trans. Inform. Theory 42 (1996), 310--316.
Mathematical Reviews (MathSciNet):
MR1375343
Digital Object Identifier: doi:10.1109/18.481810
A. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Trans. Inform. Theory 44 (1998), 2010--2017.
Mathematical Reviews (MathSciNet):
MR1664103
Digital Object Identifier: doi:10.1109/18.705584
A. R. Calderbank, The art of signaling: Fifty years of coding theory, IEEE Trans. Inform. Theory 44 (1998), 2161--2195.
Mathematical Reviews (MathSciNet):
MR1658755
Digital Object Identifier: doi:10.1109/18.720549
J. Justesen, T. Høholdt, and J. Hjaltason, Iterative list decoding, Proceedings of IEEE information theory workshop on coding and complexity (M. J. Dinneen, U. Speidel, D. Taylor, eds.), pp. 90--93, IEEE, New York, 2005.
C. Kelley and D. Sridhara, Pseudocodewords of Tanner graphs, IEEE Trans. Inform. Theory 53 (2007), 4013--4038.
Mathematical Reviews (MathSciNet):
MR2446552
Digital Object Identifier: doi:10.1109/TIT.2007.907501
R. Koetter, W. W. Li, P. O. Vontobel, and J. L. Walker, Pseudo-codewords of cycle codes via Zeta functions, Proceedings of IEEE information theory workshop (San Antonio), 2004.
Y. Kou, S. Lin, and M. P. C. Fossorier, Low density parity check codes based on finite geometries: A rediscovery and new results, IEEE Trans. Inform. Theory 47 (2001), 2711--2736.
Mathematical Reviews (MathSciNet):
MR1872835
Digital Object Identifier: doi:10.1109/18.959255
R. Lucas, M. Bosset, and M. Breitbach, On iterative soft-decision decoding of linear binary block codes and product codes, IEE J. Sel. Areas Commun. 16 (1998), 276--296.
D. J. C. MacKay and R. M. Neil, Near Shannon limit performance of low density parity check codes, Elec. Lett. 32 (1996), 1645--1646.
T. Richardson and R. Urbanke, Modern coding theory, Cambridge Univ. Press, Cambridge, 2008.
R. Smarandache and P. O. Vontobel, Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes, IEEE Trans. Inform. Theory 53 (2007), 2376--2393.
Mathematical Reviews (MathSciNet):
MR2319381
Digital Object Identifier: doi:10.1109/TIT.2007.899563
The Michigan Mathematical Journal
