Presentation	1998/3/18 Linear codes on nonsingular curves are better than those on singular curves Ryutaroh MATSUMOTO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Recently Miura generalized the construction of one-point AG codes on nonsingular curves to singular curves, and this enlarged the class of curves for code construction. The generalization does not necessarily indicate whether there are singular curves giving good codes that we cannot construct on nonsingular curves. In this paper we use the sum of information rate and relative distance as a measure of code performance. Then we show that linear codes on nonsingular curves are better than those on birationally equivalent singular curves with respect to that measure.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	algebraic geometric codes / singular curve / relative distance / information rate
Paper #
Date of Issue

Conference Information
Committee	ISEC
Conference Date	1998/3/18(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)	Linear codes on nonsingular curves are better than those on singular curves
Sub Title (in English)
Keyword(1)	algebraic geometric codes
Keyword(2)	singular curve
Keyword(3)	relative distance
Keyword(4)	information rate
1st Author's Name	Ryutaroh MATSUMOTO
1st Author's Affiliation	Dept.of Information Processing, Tokyo Institute of Technology()
Date	1998/3/18
Paper #
Volume (vol)	vol.97
Number (no)	611
Page	pp.pp.-
#Pages	5
Date of Issue