Presentation	1999/3/11 On a Greedy Algorithm for Generating Ordered Basis and Linear Codes Generated by the Algorithm Tadashi WADAYAMA, Mariko CHIKU, Yoshiharu YUBA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The paper presents an algorithm for generating an ordered basis of F^n_q, where F_q is the finite field with q-elements. The purpose of the algorithm is to construct a linear code with a large Feng-Rao designed distance d_. In order to obtain a linear code with a large d_, we need to construct a good ordered basis. The ordered basis is an indexed basis of F^n_q. The proposed algorithm improves an initial basis for each step of the algorithm according to a heuristic rule. The time complexity of the algorithm is O(n^4). The algorithm can work for arbitrary finite field, length, dimension. The linear codes obtained from the algorithm can be decoded up to ⌊(d_-1)/2⌋ with time complexity O(n^3). Some high rate codes obtained by the algorithm are comparable to the improved Geometric Goppa codes.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Linear code / Ordered basis / Feng-Rao designed distance
Paper #	IT98-103
Date of Issue

Conference Information
Committee	ISEC
Conference Date	1999/3/11(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 a Greedy Algorithm for Generating Ordered Basis and Linear Codes Generated by the Algorithm
Sub Title (in English)
Keyword(1)	Linear code
Keyword(2)	Ordered basis
Keyword(3)	Feng-Rao designed distance
1st Author's Name	Tadashi WADAYAMA
1st Author's Affiliation	Okayama Prefectural University()
2nd Author's Name	Mariko CHIKU
2nd Author's Affiliation	Okayama Prefectural University
3rd Author's Name	Yoshiharu YUBA
3rd Author's Affiliation	Okayama Prefectural University
Date	1999/3/11
Paper #	IT98-103
Volume (vol)	vol.98
Number (no)	656
Page	pp.pp.-
#Pages	6
Date of Issue