Presentation 2003/7/15
Constructions of Expander Codes Using Algebraic Geometry Codes
Hachiro FUJITA, Koichi SAKANIWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) If a code has nonzero relative miminum distance on condition that the coding rate is fixed and the code length goes to infinity, then the code is called a asymptotically good code. Sipser and Spielman constructed a family of asymptotically good codes called expander codes, by using Ramanujan graphs and good binary linear codes that attain the Gilbert-Varshamov bound, and gave an linear-time decoding algorithms for the codes. In this paper we construct some nonbinary expander codes using algebraic geometry codes that attain Tsfasman-Vladut-Zink bound, and show that the propsed codes are superior to the nonbinary analogues of their binary expander codes. We also show that the binary codes obtained from our proposed codes are superior to their original expander codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Expander Codes / Expander Graphs / Ramanujan Graphs / Asymptotically Good Codes / Algebraic Geometry Codes
Paper # IT2003-17(2003-07)
Date of Issue

Conference Information
Committee IT
Conference Date 2003/7/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constructions of Expander Codes Using Algebraic Geometry Codes
Sub Title (in English)
Keyword(1) Expander Codes
Keyword(2) Expander Graphs
Keyword(3) Ramanujan Graphs
Keyword(4) Asymptotically Good Codes
Keyword(5) Algebraic Geometry Codes
1st Author's Name Hachiro FUJITA
1st Author's Affiliation Dept. of Commun. and Integrated Systems, Tokyo Institute of Technology()
2nd Author's Name Koichi SAKANIWA
2nd Author's Affiliation Dept. of Commun. and Integrated Systems, Tokyo Institute of Technology
Date 2003/7/15
Paper # IT2003-17(2003-07)
Volume (vol) vol.103
Number (no) 214
Page pp.pp.-
#Pages 6
Date of Issue