boundsconvolutional codescyclic codesgeneralized Reed-Solomon codesgraph codesLee metriclinear codesMDS codesReed-Muller codestextbooktrellis codes
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Linear codes (general theory) (94B05) Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12) Cyclic codes (94B15) Decoding (94B35) Bounds on codes (94B65)
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- On encoding symbol degrees of array BP-XOR codes
- 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
- A course in algebraic error-correcting codes
- scientific article; zbMATH DE number 3847301 (Why is no real title available?)
- Introduction to algebraic coding theory
- Linear batch codes
- Power Decoding of Reed–Solomon Codes Revisited
- Advanced error control techniques for data storage systems.
- A Shared Steganographic File System with Error Correction
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- scientific article; zbMATH DE number 51371 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3501377 (Why is no real title available?)
- scientific article; zbMATH DE number 1284414 (Why is no real title available?)
- A novel elementary construction of matching vectors
- scientific article; zbMATH DE number 2041021 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3999824 (Why is no real title available?)
- scientific article; zbMATH DE number 2109875 (Why is no real title available?)
- scientific article; zbMATH DE number 847283 (Why is no real title available?)
- Bounds on r-identifying codes in q-ary Lee space
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- Basics of coding theory
- The statistical mechanics of near-BPS black holes
- On computing centroids according to the p-norms of Hamming distance vectors
- On the minimum stopping sets of product codes
- Binary linear codes with near-extremal maximum distance
- Fundamentals of classical and modern error-correcting codes
- Error-correction coding and decoding. Bounds, codes, decoders, analysis and applications
- Nonsingular bouncing cosmology in general relativity: physical analysis of the spacetime defect
- A coded shared atomic memory algorithm for message passing architectures
- Forward error correction via channel coding
- A combination of testability and decodability by tensor products
- Error correction coding. Mathematical methods and algorithms
- 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
- A new formula for the minimum distance of an expander code
- Overflow management with self-eliminations
- Overflow management with self-eliminations
- 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
- VSS Made Simpler
- Nonassociative geometric and quantum information flows and R-flux deformations of wormhole solutions in string gravity
- Generic error SDP and generic error CVE
- On detecting some defective items in group testing
- Playing Guess Who with your kids: code-word strategy against adversaries
- Stochastic secret sharing with 1-bit shares and applications to MPC
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- A class of error-detecting codes based on T-quasigroups
- Information set decoding for ring-linear codes
- Extensible decentralized secret sharing and application to Schnorr signatures
- Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
- Coding properties and automorphism groups of two classes of twisted generalized Reed-Solomon codes
- Practical introduction to action-dependent field theories
- A class of triple-twisted GRS codes
- Generator polynomials of cyclic expurgated or extended Goppa codes with odd characteristic
- On the structure of the Schur squares of twisted generalized Reed-Solomon codes and application to cryptanalysis
- A new path to code-based signatures via identification schemes with restricted errors
- Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
- MWS and FWS codes for coordinate-wise weight functions
- New self-dual codes from TGRS codes with general twists
- Quasi-cyclic binary extended and expurgated Goppa codes and their parameters
- Geometric and cognitive differences between logical diagrams for the Boolean algebra \(\mathbb {B}_{4}\)
- Generalized hyperderivative Reed-Solomon codes
- LCD and non-LCD (A)MDS DTRS codes with all possible hooks
- Bounded-contention coding for the additive network model
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
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)
