Threshold data structures and coding theory
From MaRDI portal
Publication:1978695
DOI10.1016/S0304-3975(99)00180-2zbMath0938.68026OpenAlexW2093480454WikidataQ126324140 ScholiaQ126324140MaRDI QIDQ1978695
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00180-2
Cites Work
- Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
- A New Solution to Coherence Problems in Multicache Systems
- Superimposed codes in the Hamming space
- On the solution of algebraic equations over finite fields
- Shift-register synthesis and BCH decoding
- Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Threshold data structures and coding theory