On error-correcting balanced codes
From MaRDI portal
Publication:4733832
DOI10.1109/18.42227zbMATH Open0683.94016OpenAlexW2134022418MaRDI QIDQ4733832FDOQ4733832
Authors: Henk van Tilborg, Mario Blaum 
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.42227
Recommendations
Cited In (18)
- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- Balanced reconstruction codes for single edits
- Explicit, almost optimal, epsilon-balanced codes
- On linear balancing sets
- Error-correcting codes with bounded running digital sum
- Equireplicate balanced binary codes for oligo arrays
- A study of primer design with \(w\)-constacyclic shift over \(\mathbb{F}_4\)
- New optimal error-correcting codes for crosstalk avoidance in on-chip data buses
- Perfect codes and balanced generalized weighing matrices. II
- Properties of optimal and near optimal edit metric error correcting codes
- On balanced codes
- \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
- Title not available (Why is that?)
- On double-byte error-correcting codes
- Error-Correcting Codes and<tex>$B_h$</tex>-Sequences
- Title not available (Why is that?)
- On optimal binary codes with unbalanced coordinates
- Coding theory based on balancing polynomials
This page was built for publication: On error-correcting balanced codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733832)
