Print Email Facebook Twitter Prefixless q-ary Balanced Codes with Fast Syndrome-Based Error Correction Title Prefixless q-ary Balanced Codes with Fast Syndrome-Based Error Correction Author Swart, T.G. (University of Johannesburg) Weber, J.H. (TU Delft Discrete Mathematics and Optimization) Schouhamer Immink, Kees A. (Turing Machines Inc.) Date 2018 Abstract We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compared with the prior art exhaustive decoding strategy. A comparison between the new and prior art schemes, both in terms of redundancy and error performance, completes the study. Subject Balanced codeconstrained codeerror correctionKnuth coderunning digital sum To reference this document use: http://resolver.tudelft.nl/uuid:694d80da-cee7-4de0-9853-597803ee93d8 DOI https://doi.org/10.1109/TIT.2017.2767034 ISSN 0018-9448 Source IEEE Transactions on Information Theory, 64 (4), 2431-2443 Bibliographical note Accepted Author Manuscript Part of collection Institutional Repository Document type journal article Rights © 2018 T.G. Swart, J.H. Weber, Kees A. Schouhamer Immink Files PDF 42589646.pdf 570.69 KB Close viewer /islandora/object/uuid:694d80da-cee7-4de0-9853-597803ee93d8/datastream/OBJ/view