Introduction to Coding Theory
From MaRDI portal
Publication:5896822
DOI10.1017/CBO9780511808968zbMATH Open1092.94001OpenAlexW2895239415MaRDI QIDQ5896822FDOQ5896822
Authors: Ron M. Roth 
Publication date: 29 March 2006
Full work available at URL: https://doi.org/10.1017/cbo9780511808968
Recommendations
boundscyclic codesconvolutional codesgeneralized Reed-Solomon codeslinear codestextbookReed-Muller codesMDS codesLee metrictrellis codesgraph codes
Linear codes (general theory) (94B05) Cyclic codes (94B15) Bounds on codes (94B65) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Convolutional codes (94B10) Decoding (94B35) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (86)
- A new formula for the minimum distance of an expander code
- Invariant codes, difference schemes, and distributive quasigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Surface defects from fractional branes. I
- Title not available (Why is that?)
- On quantum SPC product codes
- Introduction to algebraic coding theory
- On encoding symbol degrees of array BP-XOR codes
- A course in algebraic error-correcting codes
- Designing uniform computer sequential experiments with mixture levels using Lee discrepancy
- Fundamentals of classical and modern error-correcting codes
- A landscape of AdS flux vacua
- The minimum distance of graph codes
- A class of constacyclic codes are generalized Reed-Solomon codes
- Lee discrepancy and its applications in experimental designs
- New constructions of self-dual codes via twisted generalized Reed-Solomon codes
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- Good cyclic codes and the uncertainty principle
- Title not available (Why is that?)
- A combination of testability and decodability by tensor products
- On the weight distribution of the cosets of MDS codes
- A novel elementary construction of matching vectors
- Geometric and cognitive differences between logical diagrams for the Boolean algebra \(\mathbb {B}_{4}\)
- Optimal codes as Tanner codes with cyclic component codes
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
- Power Decoding of Reed–Solomon Codes Revisited
- MDS and near-MDS codes via twisted Reed-Solomon codes
- Generalized framework for group testing: queries, feedbacks and adversaries
- An expansion property of Boolean linear maps
- Improved bounds on Sidon sets via lattice packings of simplices
- The statistical mechanics of near-BPS black holes
- Title not available (Why is that?)
- Binary linear codes with near-extremal maximum distance
- Grammatically uniform population initialization for grammar-guided genetic programming
- Bounded-contention coding for the additive network model
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- Title not available (Why is that?)
- Self-predicting Boolean functions
- Nonsingular bouncing cosmology in general relativity: physical analysis of the spacetime defect
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- MDS coding is better than replication for job completion times
- Systematic and nonsystematic perfect codes of infinite length over finite fields
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- On the maximality of linear codes
- Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation
- Twisted Cohomotopy implies M-theory anomaly cancellation on 8-manifolds
- Nearly optimal robust secret sharing
- Title not available (Why is that?)
- Fuzzy asymmetric password-authenticated key exchange
- Power error locating pairs
- Title not available (Why is that?)
- Error correction coding. Mathematical methods and algorithms
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- Anticode-based locally repairable codes with high availability
- Invariant sets under linear operator and covering codes over modules
- Construction of binary minimal product parity-check matrices
- Hierarchical erasure correction of linear codes
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- A coded shared atomic memory algorithm for message passing architectures
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Power decoding Reed-Solomon codes up to the Johnson radius
- Title not available (Why is that?)
- Advanced error control techniques for data storage systems.
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
- On the minimum stopping sets of product codes
- On detecting some defective items in group testing
- Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets
- Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
- Playing Guess Who with your kids: code-word strategy against adversaries
- Zero-divisor super-\(\lambda\) graphs
- Coding and bounds for partially defective memory cells
- Title not available (Why is that?)
- Forward error correction via channel coding
- A Shared Steganographic File System with Error Correction
- Basics of coding theory
- Overflow management with self-eliminations
- Overflow management with self-eliminations
- Bounds on \(r\)-identifying codes in \(q\)-ary Lee space
- VSS Made Simpler
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Linear batch codes
- Nonassociative geometric and quantum information flows and R-flux deformations of wormhole solutions in string gravity
- Generic error SDP and generic error CVE
- Improved information set decoding algorithms over Galois ring in the Lee metric
This page was built for publication: Introduction to Coding Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896822)
