Efficient balanced codes
From MaRDI portal
Cited in
(23)- Efficient m-ary balanced codes
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- Balanced reconstruction codes for single edits
- scientific article; zbMATH DE number 7121035 (Why is no real title available?)
- Explicit, almost optimal, epsilon-balanced codes
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Delay-insensitive codes - an overview
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\)
- On negation complexity of injections, surjections and collision-resistance in cryptography
- On balanced codes
- Asynchronous simulation of Boolean networks by monotone Boolean networks
- Theory and design ofm-ary balanced codes which are invariant under symbol permutation
- On efficient high-order spectral-null codes over them-ary alphabet
- \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
- Enumeration of constant-weight run-length limited binary sequences
- Efficient q-ary immutable codes
- scientific article; zbMATH DE number 3463503 (Why is no real title available?)
- Symmetrization of bounded remainder sets
- Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
- scientific article; zbMATH DE number 3463504 (Why is no real title available?)
- Moduli of toric tilings into bounded remainder sets and balanced words
- On optimal binary codes with unbalanced coordinates
This page was built for publication: Efficient balanced codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720472)
