Article

Free access

Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Author:

Peter Bro MiltersenAuthors Info & Claims

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 556 - 563

Published: 01 January 1998 Publication History

PDF eReader

References

[1]

A. Andersson. Faster deterministic sorting and searching in linear space. In 37th IEEE Symposium on Foundations of Computer Science, pages 135-141, Burlington, Vermont, 1996.

Digital Library

Google Scholar

[2]

A. Andersson, P.B. Miltersen, S. Riis, and M. Thorup. Static dictionaries on AC~ RAMs: Query time O(~/log n~ log log n) is necessary and sufficient. In 37th IEEE Symposium on Foundations of Computer Science, pages 538-546, Burlington, Vermont, 1996.

Digital Library

Google Scholar

[3]

A.M. Ben-Amram and Z. Galil. When can we sort in o(nlogn) time? In 34th IEEE Symposium on Foundations of Computer Science, pages 538-546, Polo Alto, California, 1993.

Google Scholar

[4]

J. Bierbrauer, i. Johansson, G. Kabatianskii, and B. Smeets. On families of hash functions via geometric codes and concatenation. In: Advances in Cryptology - CRYPTO '93, Lecture Notes in Computer Science vol. 773, pp. 331-342, Springer, 1993.

Digital Library

Google Scholar

[5]

A. Brodnik and J.I. Munro. Membership in constant time and minimum space, in: Proceedings of the 1st European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 855, page 72, 1994.

Digital Library

Google Scholar

[6]

J.L. Carter and M.N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, April 1979.

Google Scholar

[7]

M. Dietzfelbinger and F. Meyer auf der Heide, Dynamic hashing in real time, in: J. Buchmann, H. Ganzinger, W. J. Paul (Eds.): Informatik ~ Festschrifl zum 60. Geburtstag yon Giinter Hotz, Teubner-Texte zur Informatik, Band 1, B.G. Teubner, 1992, pp. 95-119. (A preliminary version appeared under the title "A New Universal Class of Hash Functions and Dynamic Hashing in Real Time" in ICALP'90.)

Digital Library

Google Scholar

[8]

M. Dietzfelbinger, J. Gil, Y. Matias and N. Pippenger. Polynomial hash functions are reliable. In: Proc. 19th int 'l. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science Vol. 623, pages 235-246, Springer-Verlag, July 1992.

Digital Library

Google Scholar

[9]

M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. Technical Report 513, Fachbereich Informatik, Universit~it Dortmund, Dortmund, Germany, 1993.

Google Scholar

[10]

M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer Auf Der Heide, H. Rohnert, R .E. Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Cornput. 23 (1994) 738-761.

Digital Library

Google Scholar

[11]

M. Dietzfelbinger. Universal Hashing and k-wise Independent Random Variables via Integer Arithmetic without Primes. In Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science vol. 1046, pp. 569-580, Springer, 1996.

Digital Library

Google Scholar

[12]

S.I. Gelfand, R.L. Dobrushin, and M.S. Pinsker. On the complexity of coding. In Second International Symposium on information Theory, pages 177-184, Akademiai Kiado, Budapest, 1973.

Google Scholar

[13]

A. Fiat, M. Naor, J.P. Schmidt and A. Siegel, Non- Oblivious Hashing. In: Proceedings of the Twentieth Annual A CM Symposium on Theory of Computing, pages 367-376, 1988.

Digital Library

Google Scholar

[14]

M.L. Fredman, J. Koml6s, and E. Szemer~di. Storing a sparse table with O(1) worst case access time. Journal of the A CM, 31(3):538-544, July 1984.

Digital Library

Google Scholar

[15]

M.L. Fredman and D.E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.

Digital Library

Google Scholar

[16]

M.L. Fredman and D.E. WiUard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533-551, June 1994.

Digital Library

Google Scholar

[17]

O. Goldreich and A. Wigderson. On the Circuit Complexity of Perfect Hashing, Electronic Colloquium on Computational Complexity, TR96-04, 1996.

Google Scholar

[18]

F.J. MacWilliams and N.J.A Sloane. The Theory of Error-Correcting Codes. North Holland, Amsterdam, 1977.

Google Scholar

[19]

J.L. Massey and O.N. Garcia. Error-correcting codes in computer arithmetic. In: Advances in Information Systems Science, Vol. 4, Ch. 5. (edited by J. T. Ton). New York, Plenum Press, 1972.

Google Scholar

[20]

K. Mehlhorn and A. Tsakalidis. Data Structures. In: Handbook of Theoretical Computer Science, Vol. A: Algorithms and complexity, pp. 303-341, MIT Press, 1994.

Digital Library

Google Scholar

[21]

R. Raman. Priority queues: Small, monotone, and trans-dichotomus. In Proceedings 4th European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 121-137. Springer-Verlag, 1996.

Digital Library

Google Scholar

[22]

S.C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labelling paradigm. In 36th IEEE Symposium on Foundations of Computer Science, pages 320-328, Burlington, Vermont, 1996.

Digital Library

Google Scholar

[23]

D.A. Spielman. Linear-time encodable and decodable error-correcting codes. In Proceedings 27th annual A CM symposium on the theory of computing, pages 388-397, Los Vegas, Nevada, 1994.

Digital Library

Google Scholar

[24]

D.R. Stinton. On the connections between universal hashing, combinatorial designs and error-correcting codes. Electronic Colloquium on Computational Complexity, TR95-052, 1995.

Google Scholar

[25]

R.E. Tarjan and A.C. Yao. Storing a sparse table. Communications of the A CM, 22(11):606-611.

Digital Library

Google Scholar

[26]

M. Thorup. On RAM priority queues. In 7th A CM- SIAM Symposium on Discrete Algorithms, pages 59- 67, Atlanta, Georgia, 1996.

Digital Library

Google Scholar

[27]

A.C. Yao. Should tables be sorted? Journal of the ACM, 28:615-628, 1981.

Digital Library

Google Scholar

Cited By

View all

Gál AHansen KKoucký MPudlák PViola EKarloff HPitassi T(2012)Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gatesProceedings of the forty-fourth annual ACM symposium on Theory of computing10.1145/2213977.2214023(479-494)Online publication date: 19-May-2012
https://dl.acm.org/doi/10.1145/2213977.2214023
Ružić M(2008)Uniform deterministic dictionariesACM Transactions on Algorithms10.1145/1328911.13289124:1(1-23)Online publication date: 28-Mar-2008
https://dl.acm.org/doi/10.1145/1328911.1328912
Naor MSegev GWieder U(2008)History-Independent Cuckoo HashingProceedings of the 35th international colloquium on Automata, Languages and Programming, Part II10.1007/978-3-540-70583-3_51(631-642)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70583-3_51
Show More Cited By

Index Terms

Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Recommendations

Unidirectional error correcting/detecting codes
Byte Unidirectional Error Correcting and Detecting Codes

Efficient byte unidirectional error correcting codes that are better than byte symmetric error correcting codes are presented. The encoding and decoding algorithms are discussed. A lower bound on the number of check bits for byte unidirectional error ...
Systematic Random Error Correcting and all Unidirectional Error Detecting Codes

t-random-error correcting and all-unidirectional-error detecting (t-EC/AUED) codes obtained by appending a suffix to each codeword of a linear block code are presented. Although this technique has been previously used to construct such codes, a ...

Comments

Information & Contributors

Information

Published In

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

January 1998

704 pages

ISBN:0898714109

Chairman:
Howard Karloff

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

Article

Conference

SODA98

Sponsor:

SIGACT
SIAM

SODA98: 1998 Conference on Discrete Algorithms

January 25 - 27, 1998

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
400
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)7

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gál AHansen KKoucký MPudlák PViola EKarloff HPitassi T(2012)Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gatesProceedings of the forty-fourth annual ACM symposium on Theory of computing10.1145/2213977.2214023(479-494)Online publication date: 19-May-2012
https://dl.acm.org/doi/10.1145/2213977.2214023
Ružić M(2008)Uniform deterministic dictionariesACM Transactions on Algorithms10.1145/1328911.13289124:1(1-23)Online publication date: 28-Mar-2008
https://dl.acm.org/doi/10.1145/1328911.1328912
Naor MSegev GWieder U(2008)History-Independent Cuckoo HashingProceedings of the 35th international colloquium on Automata, Languages and Programming, Part II10.1007/978-3-540-70583-3_51(631-642)Online publication date: 7-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70583-3_51
Beame PFich F(2002)Optimal bounds for the predecessor problem and related problemsJournal of Computer and System Sciences10.1006/jcss.2002.182265:1(38-72)Online publication date: 1-Aug-2002
https://dl.acm.org/doi/10.1006/jcss.2002.1822
Pagh R(2000)A trade-off for worst-case efficient dictionariesNordic Journal of Computing10.5555/642992.6429947:3(151-163)Online publication date: 1-Sep-2000
https://dl.acm.org/doi/10.5555/642992.642994
Pagh RShmoys D(2000)Faster deterministic dictionariesProceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms10.5555/338219.338595(487-493)Online publication date: 1-Feb-2000
https://dl.acm.org/doi/10.5555/338219.338595
Miltersen PVinodchandran N(1999)Derandomizing Arthur-Merlin Games Using Hitting SetsProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796488Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796488
Hagerup TTarjan RWarnow T(1999)Fast deterministic construction of static dictionariesProceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms10.5555/314500.314594(414-418)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.5555/314500.314594
Cazals FJanardan R(1998)Effective nearest neighbors searching on the hyper-cube, with applications to molecular clusteringProceedings of the fourteenth annual symposium on Computational geometry10.1145/276884.276910(222-230)Online publication date: 7-Jun-1998
https://dl.acm.org/doi/10.1145/276884.276910

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Unidirectional error correcting/detecting codes

Byte Unidirectional Error Correcting and Detecting Codes

Systematic Random Error Correcting and all Unidirectional Error Detecting Codes

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Unidirectional error correcting/detecting codes

Byte Unidirectional Error Correcting and Detecting Codes

Systematic Random Error Correcting and all Unidirectional Error Detecting Codes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations