scientific article; zbMATH DE number 1284433

zbMath0983.94015MaRDI QIDQ4242027

Ron M. Roth, Brian Marcus, Paul H. Siegel

Publication date: 31 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

coding theoryconstrained systemslabeled graphsgate complexitysoft-decision decodingpower graphsspectral-null codesstate-splitting algorithmfinite-state encodersbitshift error correctioncomplexity of encodersdeterministic encodersencoder anticipationerror mechanismserror-correction modulation codinghigher edge graphsHilbert-Varshamov-type boundsIP encoderslook ahead encodersrecording channels and constraintssphere-packing upper boundsstethering encoderssynchronization error-correcting codestime-space complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of graph theory to circuits and networks (94C15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71) Modulation and demodulation in information and communication theory (94A14) Synchronization error-correcting codes (94B50)

Related Items (9)

Computing the edit distance of a regular language ⋮ Capacity of Higher-Dimensional Constrained Systems ⋮ Asymptotics of input-constrained binary symmetric channel capacity ⋮ On codes with local joint constraints ⋮ Approximate NFA universality and related problems motivated by information theory ⋮ Communication on Inductively Coupled Channels: Overview and Challenges ⋮ Topological entropies of a class of constrained systems ⋮ Asynchronous sliding block maps ⋮ Approximate NFA universality motivated by information theory

This page was built for publication: