Prefixless q-ary balanced codes with fast syndrome-based error correction
- Swart, Theo G., Weber, Jos H., Schouhamer Immink, Kees A.
- Authors: Swart, Theo G. , Weber, Jos H. , Schouhamer Immink, Kees A.
- Date: 2018
- Subjects: Balanced code , Constrained code , error correction
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279793 , uj:30054 , Citation: Swart, T.G., Weber, J.H. & Schouhamer Immink, K.A. 2018. Prefixless q-ary balanced codes with fast syndrome-based error correction. IEEE Transactions on Information Theory, 64(4):2431-2443. DOI:10.1109/TIT.2017.2767034
- Description: Abstract: We investigate a Knuth-like scheme for balancing q-ary codewords, which has the virtue that look-up 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 to 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.
- Full Text:
- Authors: Swart, Theo G. , Weber, Jos H. , Schouhamer Immink, Kees A.
- Date: 2018
- Subjects: Balanced code , Constrained code , error correction
- Language: English
- Type: Article
- Identifier: http://hdl.handle.net/10210/279793 , uj:30054 , Citation: Swart, T.G., Weber, J.H. & Schouhamer Immink, K.A. 2018. Prefixless q-ary balanced codes with fast syndrome-based error correction. IEEE Transactions on Information Theory, 64(4):2431-2443. DOI:10.1109/TIT.2017.2767034
- Description: Abstract: We investigate a Knuth-like scheme for balancing q-ary codewords, which has the virtue that look-up 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 to 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.
- Full Text:
Simple systematic pearson coding
- Weber, Jos H., Swart, Theo G., Schouhamer Immink, Kees A.
- Authors: Weber, Jos H. , Swart, Theo G. , Schouhamer Immink, Kees A.
- Date: 2016
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123960 , uj:20857 , Citation: Weber, J.H., Swart, T.G. & Schouhamer Immink, K.A. 2016. Simple systematic pearson coding.
- Description: Abstract: The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.
- Full Text:
- Authors: Weber, Jos H. , Swart, Theo G. , Schouhamer Immink, Kees A.
- Date: 2016
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/123960 , uj:20857 , Citation: Weber, J.H., Swart, T.G. & Schouhamer Immink, K.A. 2016. Simple systematic pearson coding.
- Description: Abstract: The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.
- Full Text:
- «
- ‹
- 1
- ›
- »