Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
From MaRDI portal
Publication:5089193
Recommendations
- Improved explicit data structures in the bitprobe model
- Error-correcting codes for byte-organized memory systems
- Code Constructions for Error Control in Byte Organized Memory Systems
- On the structure of optimal error-correcting codes
- Error-correcting data structures
- Error-correcting data structures
- A Survey of Data Structures in the Bitprobe Model
- On codes with summation of data bits in concurrent error detection systems
- Two improved schemes in the bitprobe model
- An incremental node embedding technique for error correcting output codes
Cites work
- A Survey of Data Structures in the Bitprobe Model
- Are Bitvectors Optimal?
- Data structures for storing small sets in the bitprobe model
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 1875423 (Why is no real title available?)
- Improved explicit data structures in the bitprobe model
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- Low redundancy in static dictionaries with constant query time
- Membership in Constant Time and Almost-Minimum Space
- On a class of error correcting binary group codes
- Set membership with a few bit probes
- Set membership with non-adaptive bit probes
- Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
- Space/time trade-offs in hash coding with allowable errors
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Two new schemes in the bitprobe model
Cited in
(2)
This page was built for publication: Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089193)
