On \(t\)-revealing codes in binary Hamming spaces
DOI10.1016/j.ic.2019.104455zbMath1430.68103OpenAlexW2969653957WikidataQ127335457 ScholiaQ127335457MaRDI QIDQ2272993
Publication date: 17 September 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.104455
information retrievalassociative memoryidentifying codeslist decodingLevenshtein's sequence reconstruction problemmajority voting on coordinates
Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- More results on the complexity of identifying problems in graphs
- Information retrieval and the average number of input clues
- On identifying codes in binary Hamming spaces
- On a new class of identifying codes in graphs
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- Information retrieval with unambiguous output
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- Information Retrieval With Varying Number of Input Clues
- On a new class of codes for identifying vertices in graphs
- Efficient reconstruction of sequences
- Minimum Number of Input Clues in Robust Information Retrieval
- Connected Identifying Codes
- Codes for Information Retrieval With Small Uncertainty
This page was built for publication: On \(t\)-revealing codes in binary Hamming spaces
