Asymptotically optimal low-cost solid codes

Authors:
Helmut Jü/rgensen;Stavros Konstantinidis;Nguyen Huong Lâ/m
Affiliations:
Department of Computer Science, The University of Western Ontario London, Ontario, Canada N6A 5B7/ and Institut fü/r Informatik, Universitä/t Potsdam, August-Bebel-Straß/e 89, D-14482 ...;Department of Mathematics and Computing Science, Saint Mary's University Halifax, Nova Scotia, Canada B3H 3C3;Hanoi Institute of Mathematics, 18 Hoang Quoc Viet Road, 10307 Hanoi, Vietnam
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2004

Citing 7
Cited 2

Solid codes

Journal of Information Processing and Cybernetics
Codes

Handbook of formal languages, vol. 1
Maximal solid codes

Journal of Automata, Languages and Combinatorics
An algebra of discrete channels that involve combinations of three basic errors types

Information and Computation
Finite maximal solid codes

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Error-detecting properties of languages

Theoretical Computer Science

Synchronization

Information and Computation
Peptide computing: universality and theoretical model

UC'06 Proceedings of the 5th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new construction of solid codes is introduced. With this construction one obtains classes of solid codes which are asymptotically optimal in terms of information rate and which have low-cost systematic encoding and decoding algorithms. The construction uses a new result on the asymptotic average length of maximal runs in words.