Presentation	2000/3/16 On the second step in the Guruswami-Sudan list decoding algorithm for AG codes Ryutaroh MATSUMOTO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In the list decoding of AG codes, we have to find all linear factors of a univariate polynomial over an algebraic function field. We generalize the factorization method by Hoholdt and Refslund Nielsen for the Hermitian function field to arbitrary algebraic function field. The algorithm is probabilistic and its running time is O(s^2l^2logqloglloglogl), where l is the maximum pole order of the coefficients of the polynomial, q the size of the finite field, and s the size of the list. In the list decoding we also have to find a basis of a linear system with pairwise distinct zero orders at a place of the function field. We also discuss how to find such a basis.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	algebraic geometry codes / list decoding / factorization
Paper #	IT99-75,ISEC99-114,SST99-123
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2000/3/16(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 Security (ISEC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	On the second step in the Guruswami-Sudan list decoding algorithm for AG codes
Sub Title (in English)
Keyword(1)	algebraic geometry codes
Keyword(2)	list decoding
Keyword(3)	factorization
1st Author's Name	Ryutaroh MATSUMOTO
1st Author's Affiliation	Sakaniwa Lab., Dept.of Electrical & Electronic Eng., Tokyo Institute of Technology()
Date	2000/3/16
Paper #	IT99-75,ISEC99-114,SST99-123
Volume (vol)	vol.99
Number (no)	701
Page	pp.pp.-
#Pages	6
Date of Issue