Efficient balanced codes
From MaRDI portal
Publication:3720472
DOI10.1109/TIT.1986.1057136zbMath0591.94030OpenAlexW2125636047MaRDI QIDQ3720472
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1986.1057136
Related Items (17)
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography ⋮ Delay-insensitive codes - an overview ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ On optimal binary codes with unbalanced coordinates ⋮ Unnamed Item ⋮ A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\) ⋮ Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits ⋮ Efficient \(q\)-ary immutable codes ⋮ Incomplete sums, DC-constrained codes, and codes that maintain synchronization ⋮ Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms ⋮ On efficient high-order spectral-null codes over them-ary alphabet ⋮ Theory and design ofm-ary balanced codes which are invariant under symbol permutation ⋮ Unnamed Item ⋮ Enumeration of constant-weight run-length limited binary sequences ⋮ Efficient \(m\)-ary balanced codes ⋮ Moduli of toric tilings into bounded remainder sets and balanced words ⋮ Symmetrization of bounded remainder sets
This page was built for publication: Efficient balanced codes
