Introduction to Coding Theory
From MaRDI portal
Publication:5896822
DOI10.1017/CBO9780511808968zbMath1092.94001MaRDI QIDQ5896822
Publication date: 29 March 2006
Full work available at URL: https://doi.org/10.1017/cbo9780511808968
Reed-Muller codes; textbook; linear codes; bounds; MDS codes; cyclic codes; convolutional codes; generalized Reed-Solomon codes; Lee metric; trellis codes; graph codes
94B05: Linear codes (general theory)
94B65: Bounds on codes
94B12: Combined modulation schemes (including trellis codes) in coding theory
94B15: Cyclic codes
94B35: Decoding
94B10: Convolutional codes
94-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory
Related Items
A Decoding Approach to Reed–Solomon Codes from Their Definition, Self-Predicting Boolean Functions, r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube, Unnamed Item, Unnamed Item, The statistical mechanics of near-BPS black holes, Bounds on r-identifying codes in q-ary Lee space, Binary Linear Codes with Near-Extremal Maximum Distance, Nonsingular bouncing cosmology in general relativity: physical analysis of the spacetime defect, On the minimum stopping sets of product codes, A combination of testability and decodability by tensor products, Improved Bounds on Sidon Sets via Lattice Packings of Simplices, Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities, Overflow management with self-eliminations, Overflow management with self-eliminations, A new formula for the minimum distance of an expander code, Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets, Coding and bounds for partially defective memory cells, A class of constacyclic codes are generalized Reed-Solomon codes, New constructions of self-dual codes via twisted generalized Reed-Solomon codes, Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\), Improved information set decoding algorithms over Galois ring in the Lee metric, On the weight distribution of the cosets of MDS codes, Zero-divisor super-\(\lambda\) graphs, On encoding symbol degrees of array BP-XOR codes, Improved constructions for non-adaptive threshold group testing, A novel elementary construction of matching vectors, A coded shared atomic memory algorithm for message passing architectures, Geometric and cognitive differences between logical diagrams for the Boolean algebra \(\mathbb {B}_{4}\), Bounded-contention coding for the additive network model, The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes, Twisted Cohomotopy implies M-theory anomaly cancellation on 8-manifolds, Power error locating pairs, Construction of binary minimal product parity-check matrices, Lee discrepancy and its applications in experimental designs, On the maximality of linear codes, Good cyclic codes and the uncertainty principle, Anticode-based locally repairable codes with high availability, Designing uniform computer sequential experiments with mixture levels using Lee discrepancy, Power decoding Reed-Solomon codes up to the Johnson radius, Construction of MDS twisted Reed-Solomon codes and LCD MDS codes, On quantum SPC product codes, Hierarchical erasure correction of linear codes, Nearly optimal robust secret sharing, Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes, Invariant codes, difference schemes, and distributive quasigroups, Generalized framework for group testing: queries, feedbacks and adversaries, Grammatically uniform population initialization for grammar-guided genetic programming, Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems, MDS and near-MDS codes via twisted Reed-Solomon codes, Surface defects from fractional branes. I, Systematic and nonsystematic perfect codes of infinite length over finite fields, A landscape of AdS flux vacua, Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation, Optimal codes as Tanner codes with cyclic component codes, Invariant sets under linear operator and covering codes over modules, MDS coding is better than replication for job completion times, Fuzzy asymmetric password-authenticated key exchange, Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks, An Expansion Property of Boolean Linear Maps, The Minimum Distance of Graph Codes, Linear Batch Codes, Power Decoding of Reed–Solomon Codes Revisited, A Shared Steganographic File System with Error Correction
