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