Design of some new Balanced Codes
@article{Tallini1993DesignOS,
title={Design of some new Balanced Codes},
author={Luca G. Tallini and Renato M. Capocelli and Bella Bose},
journal={Proceedings. IEEE International Symposium on Information Theory},
year={1993},
pages={7-7},
url={https://api.semanticscholar.org/CorpusID:62032916}
}The set of information words is divided into two subsets: 1) the subset of words that are close to balanced and 2)the subset of Words that are not close tobalanced; then words in each subset are encoded with different methods.
26 Citations
Design of some new efficient balanced codes
- 1996
Mathematics, Computer Science
It is shown that the current scheduling tool can be easily extended to schedule the precedence-constrained periodic task set derived from a design diagram, which goes beyond the traditional way of examining a schedule as a static Gannett chart.
An Abstract of the Thesis of Title: Design of Some New Efficient Balanced Codes Design of Some New Efficient Balanced Codes Redacted for Privacy
Computer Science, Mathematics
New methods to construct efficient balanced codes based on the concept of tail-map are presented, improving the constructions found in the literature.
Balanced codes with parallel encoding/decoding
- 1994
Computer Science, Mathematics
The paper contains simple and efficient parallel encoding/decoding schemes to construct balanced codes and a particular one is described for k=32 and r=6.
Very Efficient Balanced Codes
- 2010
Computer Science, Mathematics
A new construction of sets of balanced codewords is presented, which is simple, does not use look-up tables, and is less redundant than Knuth's construction.
Simple balanced codes that approach capacity
- 2009
Computer Science, Mathematics
A new construction of sets of balanced codewords is presented, which is simple, does not use look-up tables, and is less redundant than Knuth's construction.
Balanced codes for noise reduction in VLSI systems
- 1994
Computer Science, Engineering
Methods for the construction of balanced codes, which use parallel encoding/decoding are described, which uses fewer check bits and less hardware complexity than the existing codes.
Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight
- 2022
Mathematics, Computer Science
Efficient coding methods that work for both 2D RC constrained codes and 2D subarray constrained codes are presented and it is shown that, for sufficiently large array size, there exists linear-time encoding/decoding algorithm that incurs at most one redundant bit.
Constant Weight Codes: An Approach Based on Knuth's Balancing Method
- 2014
Computer Science, Mathematics
In this article, we study properties and algorithms for constructing sets of constant weight codewords with bipolar symbols, where the sum of the symbols is a constant q, q\neq 0. We show various…
Knuth’s balancing of codewords revisited
- 2008
Mathematics
This paper presents results of attempts to improve the performance of Knuthpsilas balanced codes, a very simple algorithm for constructing sets of bipolar codewords with equal numbers of dasia1psil as and dasia-1psils, called balanced codes.
Knuth's Balanced Codes Revisited
- 2010
Computer Science, Mathematics
This paper presents results of its attempts to improve the performance of Knuth's balanced codes, and states that the algorithm is well suited for use with large codewords.
5 References
On balanced codes
- 1990
Computer Science, Mathematics
The 2/sup 2/-r-1 construction given by D.E. Knuth is improved and the new codes are shown to be optimal when Knuth's complementation method is used.
On Unordered Codes
- 1991
Computer Science, Mathematics
By extending the results obtained by D. E. Knuth (1986), a parallel unordered coding scheme with 2/sup r/ information bits is described. Balanced codes in which each codeword contains equal amounts…
Design of efficient balanced codes
- 1989
Computer Science
A class of balanced (or DC-free) codes that are useful for unidirectional and asymmetric error detection is defined. Optimal (serial and parallel) balanced codes are constructed.<<ETX>>
Efficient balanced codes
- 1986
Computer Science, Mathematics
Coding schemes in which each codeword contains equally many zeros and ones are constructed in such a way that they can be efficiently encoded and decoded.