Threshold data structures and coding theory

DOI10.1016/S0304-3975(99)00180-2zbMATH Open0938.68026OpenAlexW2093480454WikidataQ126324140 ScholiaQ126324140MaRDI QIDQ1978695FDOQ1978695

Authors: Yanyan Li 

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

Recommendations

• A compact data structure for representing a dynamic multiset
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• Membership in Constant Time and Almost-Minimum Space
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model

zbMATH Keywords

finite fieldserror-correcting codeshardware designcache coherence

Mathematics Subject Classification ID

Data structures (68P05) Computer system organization (68M99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Shift-register synthesis and BCH decoding
• Title not available (Why is that?)
• On the solution of algebraic equations over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Encoding and error-correction procedures for the Bose-Chaudhuri codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Solution to Coherence Problems in Multicache Systems
• Superimposed codes in the Hamming space
• Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
• Title not available (Why is that?)
• Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)

Cited In (1)

• Does the Shannon bound really apply to all data structures?

This page was built for publication: Threshold data structures and coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978695)