- Title
- An algorithm for BCH codes extended with finite state automata
- Creator
- Kelarev, Andrei
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/31569
- Identifier
- vital:5173
- Identifier
- http://iospress.metapress.com/content/p44678646100j300/fulltext.pdf
- Identifier
- ISSN:0169-2968
- Abstract
- This articles develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with finite state automata. Ou algorithm computes the largest number of errors that the extended codes can correct, and finds a generator for each optimal code in this class of extensions. The question of finding codes with largest possible information rates remains open.; C1
- Relation
- Fundamenta Informaticae Vol. 84, no. 1 (2008), p. 51-60
- Rights
- Copyright IOS Press
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Mathematics; Computers; Finite fields; BCH codes; Finite state automata
- Reviewed
- Hits: 592
- Visitors: 599
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|