NDLI: On Expanded Cyclic and Reed

Content Provider	IEEE Xplore Digital Library
Author	Yingquan Wu
Copyright Year	1963
Abstract	This paper offers new insights into expanded cyclic and Reed-Solomon codes. First, we present a new description of general expanded codes defined over GF(qm). The proposed explicit description of the expanded generator matrix and the expanded parity check matrix reserves the symbol-wise algebraic structure. We reveal that the dual of an expanded code is the symbol-wise dual code expanded by the dual basis. Second, we characterize expanded cyclic codes utilizing the proposed expanded generator matrix (a similar analysis may be carried out over the proposed expanded parity check matrix). We focus on exploring the properties of component words of a codeword as well as their reciprocal relations. We reveal that the existence of subspace subcodes is dictated by conjugate roots of its dual generator polynomial, but not by its nonconjugate roots. We further show that each generator (parity check) matrix can be divided into block-bidiagonal submatrices associated with conjugate roots of the dual generator (generator) polynomial. Third, we shed light on binary expanded Reed-Solomon codes, which are of particular mathematical and practical interest. We first show an explicit way of constructing superior subspace subcodes utilizing the product basis which exhibit a higher dimension than the counterpart subfield subcodes. We next demonstrate that the effective dimension of the expanded parity check (generator) matrix, which governs the complexity of maximum-likelihood soft-decision decoding, can be noticeably reduced by employing block-bidiagonal structures of submatrices associated with conjugate roots of the generator (dual generator) polynomial. We finally conclude that the fixed-rate binary expanded Reed-Solomon codes are asymptotically “bad,” regardless of basis realization, in the sense that the ratio of minimum distance over code length diminishes with code length going to infinity. We assert “badness” in three scenarios, namely, (1) (conventional) fixed starting spectral null for all rates; (2) centered spectral null for rates above ¹/₃; and (3) dynamic spectral null for rates above ¹¹/₂₁. Our conclusions overturn the prevailing conjecture that binary expanded Reed-Solomon codes, particularly high-rate ones, are asymptotically “good” codes, while deviating from the ensemble of generalized Reed-Solomon codes which asymptotically achieve the Gilbert-Varshamov bound.
Sponsorship	IEEE Information Theory Society
Starting Page	601
Ending Page	620
Page Count	20
File Size	2084842
File Format	PDF
ISSN	00189448
Volume Number	57
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Generators Polynomials Parity check codes Maximum likelihood decoding Indexes Special issues and sections trace-dual subbasis Asymptotic minimum distance bound basis binary expanded Reed–Solomon codes block-bidiagonal structure dual basis dual expanded codes effective trellis dimension expanded codes expanded cyclic codes product basis subspace subcodes
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Subspace subcodes of Reed-Solomon codes

On decoding doubly extended Reed-Solomon codes

Hardware implementation of soft-decision decoding for Reed-Solomon code

High-throughput dual-shift stochastic-detection quasi-cyclic LDPC decoder

Parity Check based redistribution of secret shares

Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes

Time domain decoding of extended Reed-Solomon codes

Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

Decoding binary BCH codes

On Expanded Cyclic and Reed–Solomon Codes

Similar Documents

Subspace subcodes of Reed-Solomon codes

On decoding doubly extended Reed-Solomon codes

Hardware implementation of soft-decision decoding for Reed-Solomon code

High-throughput dual-shift stochastic-detection quasi-cyclic LDPC decoder

Parity Check based redistribution of secret shares

Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes

Time domain decoding of extended Reed-Solomon codes

Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

Decoding binary BCH codes

On Expanded Cyclic and Reed–Solomon Codes