Presentation 2003/9/10
An Algorithm for Computing the Local Distance Profile of Binary Linear Codes Closed under a Group of Permutations
Kenji YASUNAGA, Toru FUJIWARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose an algorithm for computing the local distance profile of binary linear codes which are closed under a group of permutations. An invariance property is used in the algorithm, which is an extension of the invariance property used in a known algorithm for binary cyclic codes. To use the extended invariance property, the proposed algorithm regards the code as the set of cosets of a subcode. The set of cosets are partitioned into equivalence classes by the invariance property. Only the local distance subprofile for the representative coset in each equivalence class is computed. We apply the algorithm to the (128, k) extended primitive BCH codes, and obtain the local distance profile of codes for k ≦43.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Local distance profile / zero neighbor / invariance property / coset / extended primitive BCH code
Paper # IT2003-47
Date of Issue

Conference Information
Committee IT
Conference Date 2003/9/10(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Algorithm for Computing the Local Distance Profile of Binary Linear Codes Closed under a Group of Permutations
Sub Title (in English)
Keyword(1) Local distance profile
Keyword(2) zero neighbor
Keyword(3) invariance property
Keyword(4) coset
Keyword(5) extended primitive BCH code
1st Author's Name Kenji YASUNAGA
1st Author's Affiliation Graduate School of Information Science and Technology, Osaka University()
2nd Author's Name Toru FUJIWARA
2nd Author's Affiliation Graduate School of Information Science and Technology, Osaka University
Date 2003/9/10
Paper # IT2003-47
Volume (vol) vol.103
Number (no) 308
Page pp.pp.-
#Pages 5
Date of Issue