Subcodes constructed from bases of Reed-Solomon codes.
Saved in:
| Title: | Subcodes constructed from bases of Reed-Solomon codes. |
|---|---|
| Authors: | Fuwa, Shigehide1, Tanabe, Hidehiko1, Umeda, Hiroyuki1 |
| Source: | Electronics & Communications in Japan, Part 1: Communications. Jul2003, Vol. 86 Issue 7, p64-73. 10p. |
| Subjects: | Reed-Solomon codes, Digital signal processing mathematics, Error-correcting codes, Coding theory, Telecommunication, Decoders (Electronics) |
| Abstract: | This paper proposes a method of constructing nonlinear cyclic codes that form an additive group for which the decoding complexity or error correcting performance is improved relative to RS codes, which are typical linear cyclic codes. First, a code with information digit count k = 1 is constructed by using multiple RS code basis vectors obtained from Galois field Fourier transforms. Then, for k 1, codes are constructed from this code by using idempotent elements. Also, a code with code length n = 7 was constructed as an example, and both its minimal trellis diagram complexity and bit error rate on the AWGN channel due to a computer simulation were shown to be excellent. In addition, an iterative decoder was applied to the codes with k = 4 and 5, which had peak trellis diagram complexity, and it was shown that the decoding complexity could be reduced. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 86(7): 64–73, 2003; Published online in Wiley InterScience ( |
| Copyright of Electronics & Communications in Japan, Part 1: Communications is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 13539458 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Subcodes constructed from bases of Reed-Solomon codes. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Fuwa%2C+Shigehide%22">Fuwa, Shigehide</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Tanabe%2C+Hidehiko%22">Tanabe, Hidehiko</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Umeda%2C+Hiroyuki%22">Umeda, Hiroyuki</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Electronics+%26+Communications+in+Japan%2C+Part+1%3A+Communications%22">Electronics & Communications in Japan, Part 1: Communications</searchLink>. Jul2003, Vol. 86 Issue 7, p64-73. 10p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Reed-Solomon+codes%22">Reed-Solomon codes</searchLink><br /><searchLink fieldCode="DE" term="%22Digital+signal+processing+mathematics%22">Digital signal processing mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Error-correcting+codes%22">Error-correcting codes</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication%22">Telecommunication</searchLink><br /><searchLink fieldCode="DE" term="%22Decoders+%28Electronics%29%22">Decoders (Electronics)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper proposes a method of constructing nonlinear cyclic codes that form an additive group for which the decoding complexity or error correcting performance is improved relative to RS codes, which are typical linear cyclic codes. First, a code with information digit count k = 1 is constructed by using multiple RS code basis vectors obtained from Galois field Fourier transforms. Then, for k 1, codes are constructed from this code by using idempotent elements. Also, a code with code length n = 7 was constructed as an example, and both its minimal trellis diagram complexity and bit error rate on the AWGN channel due to a computer simulation were shown to be excellent. In addition, an iterative decoder was applied to the codes with k = 4 and 5, which had peak trellis diagram complexity, and it was shown that the decoding complexity could be reduced. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 86(7): 64–73, 2003; Published online in Wiley InterScience (<URL>www.interscience.wiley.com</URL>). DOI 10.1002/ecja.1170 [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Electronics & Communications in Japan, Part 1: Communications is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13539458 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/ecja.1170 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 64 Subjects: – SubjectFull: Reed-Solomon codes Type: general – SubjectFull: Digital signal processing mathematics Type: general – SubjectFull: Error-correcting codes Type: general – SubjectFull: Coding theory Type: general – SubjectFull: Telecommunication Type: general – SubjectFull: Decoders (Electronics) Type: general Titles: – TitleFull: Subcodes constructed from bases of Reed-Solomon codes. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Fuwa, Shigehide – PersonEntity: Name: NameFull: Tanabe, Hidehiko – PersonEntity: Name: NameFull: Umeda, Hiroyuki IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 07 Text: Jul2003 Type: published Y: 2003 Identifiers: – Type: issn-print Value: 87566621 Numbering: – Type: volume Value: 86 – Type: issue Value: 7 Titles: – TitleFull: Electronics & Communications in Japan, Part 1: Communications Type: main |
| ResultId | 1 |
