Justesen-Type Modified Expander Codes and Their Decoding Algorithm
Summary :
In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes. Recently, Barg and Zemor [2] gave a modified construction of expander codes, which greatly improves the code parameters. In this paper we present a new simple algebraic decoding algorithm for the modified expander codes of Barg and Zemor, and give a Justesen-type construction of linear-time decodable asymptotically good binary linear codes that meet the Zyablov bound.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.10 pp.2708-2714
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.10.2708
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hachiro FUJITA, Kohichi SAKANIWA, "Justesen-Type Modified Expander Codes and Their Decoding Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 10, pp. 2708-2714, October 2005, doi: 10.1093/ietfec/e88-a.10.2708.
Abstract: In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes. Recently, Barg and Zemor [2] gave a modified construction of expander codes, which greatly improves the code parameters. In this paper we present a new simple algebraic decoding algorithm for the modified expander codes of Barg and Zemor, and give a Justesen-type construction of linear-time decodable asymptotically good binary linear codes that meet the Zyablov bound.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.10.2708/_p
Copy
@ARTICLE{e88-a_10_2708,
author={Hachiro FUJITA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Justesen-Type Modified Expander Codes and Their Decoding Algorithm},
year={2005},
volume={E88-A},
number={10},
pages={2708-2714},
abstract={In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes. Recently, Barg and Zemor [2] gave a modified construction of expander codes, which greatly improves the code parameters. In this paper we present a new simple algebraic decoding algorithm for the modified expander codes of Barg and Zemor, and give a Justesen-type construction of linear-time decodable asymptotically good binary linear codes that meet the Zyablov bound.},
keywords={},
doi={10.1093/ietfec/e88-a.10.2708},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Justesen-Type Modified Expander Codes and Their Decoding Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2708
EP - 2714
AU - Hachiro FUJITA
AU - Kohichi SAKANIWA
PY - 2005
DO - 10.1093/ietfec/e88-a.10.2708
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2005
AB - In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes. Recently, Barg and Zemor [2] gave a modified construction of expander codes, which greatly improves the code parameters. In this paper we present a new simple algebraic decoding algorithm for the modified expander codes of Barg and Zemor, and give a Justesen-type construction of linear-time decodable asymptotically good binary linear codes that meet the Zyablov bound.
ER -
English
