Perfect (d,k)-codes capable of correcting single peak-shifts
From MaRDI portal
Publication:4202095
DOI10.1109/18.212300zbMath0776.94015OpenAlexW2161111517MaRDI QIDQ4202095
No author found.
Publication date: 5 December 1993
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.212300
Related Items (7)
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes ⋮ Integer codes capable of correcting burst asymmetric errors ⋮ Conflict-avoiding codes and cyclic triple systems ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ On perfect \(t\)-shift codes in abelian groups ⋮ Fundamentals of coding type problems ⋮ Optimal equi-difference conflict-avoiding codes of weight four
This page was built for publication: Perfect (d,k)-codes capable of correcting single peak-shifts