Compressing inconsistent data
From MaRDI portal
Publication:4838625
DOI10.1109/18.335882zbMath0939.68509OpenAlexW2102302255MaRDI QIDQ4838625
Publication date: 6 July 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335882
Network design and communication in computer systems (68M10) Information and communication theory, circuits (94-XX)
Related Items (14)
Difference covering arrays and pseudo-orthogonal Latin squares ⋮ On the extremal combinatorics of the Hamming space ⋮ Covering arrays on product graphs ⋮ Locating and detecting arrays for interaction faults ⋮ Constructions of difference covering arrays. ⋮ Unnamed Item ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Recursive bounds for perfect hashing ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ On codes with the identifiable parent property ⋮ Covering arrays on graphs ⋮ On (\(g\), 4; 1)-difference matrices ⋮ Frameproof codes against limited coalitions of pirates ⋮ Mutually unbiased maximally entangled bases from difference matrices
This page was built for publication: Compressing inconsistent data
