Efficient \(q\)-ary immutable codes
From MaRDI portal
Publication:1180148
DOI10.1016/0166-218X(91)90106-7zbMath0736.94018WikidataQ127679153 ScholiaQ127679153MaRDI QIDQ1180148
Luisa Gargano, Renato M. Capocelli, Ugo Vaccaro
Publication date: 27 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
On efficient high-order spectral-null codes over them-ary alphabet ⋮ Efficient \(m\)-ary balanced codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The morphology of partially ordered sets
- An asymptotic formula in the theory of compositions
- A decomposition theorem for partially ordered sets
- A note on error detection codes for asymmetric channels
- Optimal error detection codes for completely asymmetric binary channels
- How to reuse a “write-once≓ memory
- An efficient algorithm for testing immutability of variable-length codes
- Efficient balanced codes
- On testing for immutability of codes (Corresp.)
- Optimal Unidirectional Error Detecting/Correcting Codes
- Normalized Matching in Direct Products of Partial Orders
