The following pages link to Efficient balanced codes (Q3720472):
Displaying 23 items.
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- Enumeration of constant-weight run-length limited binary sequences (Q764254) (← links)
- Delay-insensitive codes - an overview (Q1111528) (← links)
- Efficient \(q\)-ary immutable codes (Q1180148) (← links)
- Efficient \(m\)-ary balanced codes (Q1283068) (← links)
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization (Q1802188) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- Moduli of toric tilings into bounded remainder sets and balanced words (Q2849191) (← links)
- On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography (Q3179494) (← links)
- Combinatorial properties of balanced codes over the complex<i>m</i>-th roots of unity and efficient coding algorithms (Q3379155) (← links)
- On efficient high-order spectral-null codes over the<i>m</i>-ary alphabet (Q3379156) (← links)
- On balanced codes (Q3484768) (← links)
- (Q4048927) (← links)
- (Q4048928) (← links)
- Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks (Q4571180) (← links)
- Explicit, almost optimal, epsilon-balanced codes (Q4977975) (← links)
- (Q5121899) (← links)
- (Q5239755) (← links)
- Symmetrization of bounded remainder sets (Q5268012) (← links)
- Theory and design of<i>m</i>-ary balanced codes which are invariant under symbol permutation (Q5473104) (← links)
- A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\) (Q6040636) (← links)
- Balanced reconstruction codes for single edits (Q6564093) (← links)
- \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions (Q6635103) (← links)
