Prefixless q-ary balanced codes with ECC
- Swart, Theo G., Immink, Kees A. Schouhamer
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Q-ary codewords , Coding , Decoding
- Type: Article
- Identifier: uj:4848 , http://hdl.handle.net/10210/12515
- Description: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors.
- Full Text:
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Q-ary codewords , Coding , Decoding
- Type: Article
- Identifier: uj:4848 , http://hdl.handle.net/10210/12515
- Description: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors.
- Full Text:
Extension of Knuth's balancing algorithm with error correction
- Weber, Jos H., Ferreira, Hendrik C., Immink, Kees A. Schouhamer
- Authors: Weber, Jos H. , Ferreira, Hendrik C. , Immink, Kees A. Schouhamer
- Date: 2011
- Subjects: Error correction , Knuth's balancing algorithm
- Type: Article
- Identifier: uj:6083 , ISSN 9789081721905 , http://hdl.handle.net/10210/10931
- Description: Knuth's celebrated balancing method consists of inverting the first z bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index z to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is extended with error-correcting capabilities, where it is allowed to give unequal protection levels to the prefix and the payload. An analysis with respect to the redundancy of the proposed method is performed, showing good results while maintaining the simplicity features of the original scheme.
- Full Text:
- Authors: Weber, Jos H. , Ferreira, Hendrik C. , Immink, Kees A. Schouhamer
- Date: 2011
- Subjects: Error correction , Knuth's balancing algorithm
- Type: Article
- Identifier: uj:6083 , ISSN 9789081721905 , http://hdl.handle.net/10210/10931
- Description: Knuth's celebrated balancing method consists of inverting the first z bits in a binary information sequence, such that the resulting sequence has as many ones as zeroes, and communicating the index z to the receiver through a short balanced prefix. In the proposed method, Knuth's scheme is extended with error-correcting capabilities, where it is allowed to give unequal protection levels to the prefix and the payload. An analysis with respect to the redundancy of the proposed method is performed, showing good results while maintaining the simplicity features of the original scheme.
- Full Text:
Balanced runlength limited codes using Knuth’s algorithm
- Immink, Kees A. Schouhamer, Weber, Jos H., Ferreira, Hendrik C.
- Authors: Immink, Kees A. Schouhamer , Weber, Jos H. , Ferreira, Hendrik C.
- Date: 2011
- Subjects: Balanced codes , Bipolar codewords , Knuth’s algorithm
- Type: Article
- Identifier: uj:6263 , ISSN 6033677 , http://hdl.handle.net/10210/8252
- Description: Knuth published a very simple algorithm for constructing bipolar codewords with equal numbers of +1’s and -1’s, called balanced codes. In our paper we will present new code constructions that generate balanced runlength limited sequences using a modification of Knuth’s algorithm.
- Full Text:
- Authors: Immink, Kees A. Schouhamer , Weber, Jos H. , Ferreira, Hendrik C.
- Date: 2011
- Subjects: Balanced codes , Bipolar codewords , Knuth’s algorithm
- Type: Article
- Identifier: uj:6263 , ISSN 6033677 , http://hdl.handle.net/10210/8252
- Description: Knuth published a very simple algorithm for constructing bipolar codewords with equal numbers of +1’s and -1’s, called balanced codes. In our paper we will present new code constructions that generate balanced runlength limited sequences using a modification of Knuth’s algorithm.
- Full Text:
Prefixless q-ary balanced codes with ECC
- Swart, Theo G., Immink, Kees A. Schouhamer
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Balanced q-ary codewords , Cable communication , Balanced p-bit prefix
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/164500 , uj:15463 , Citation: Swart, T.G. & Immink, K.A.S. 2013. Prefixless q-ary Balanced Codes with ECC. ITW Sevilla 2013, IEEE Information Theory Workshop, Seville, Spain, 9-13 September 2013, ISBN 978-1-4673-0223-4/13, p. 462 - 466.
- Description: Abstract: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors
- Full Text:
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Balanced q-ary codewords , Cable communication , Balanced p-bit prefix
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/164500 , uj:15463 , Citation: Swart, T.G. & Immink, K.A.S. 2013. Prefixless q-ary Balanced Codes with ECC. ITW Sevilla 2013, IEEE Information Theory Workshop, Seville, Spain, 9-13 September 2013, ISBN 978-1-4673-0223-4/13, p. 462 - 466.
- Description: Abstract: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors
- Full Text:
Prefixless q-ary balanced codes with ECC
- Swart, Theo G., Immink, Kees A. Schouhamer
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Balanced codes
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/18346 , uj:15988 , ISBN: 978-1-4673-0223-4 , Citation: Swart, T.G. & Immink, K.A.S. 2013. Prefixless q-ary balanced codes with ECC. IEEE Information Theory Workshop, 9-13 September, 2013, Seville, Spain, ISBN: 978-1-4673-0223-4.
- Description: Abstract: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors.
- Full Text:
- Authors: Swart, Theo G. , Immink, Kees A. Schouhamer
- Date: 2013
- Subjects: Balanced codes
- Language: English
- Type: Conference proceedings
- Identifier: http://hdl.handle.net/10210/18346 , uj:15988 , ISBN: 978-1-4673-0223-4 , Citation: Swart, T.G. & Immink, K.A.S. 2013. Prefixless q-ary balanced codes with ECC. IEEE Information Theory Workshop, 9-13 September, 2013, Seville, Spain, ISBN: 978-1-4673-0223-4.
- Description: Abstract: We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors.
- Full Text:
- «
- ‹
- 1
- ›
- »