Fundamentals of coding type problems

DOI10.1080/09720529.2007.10698106MaRDI QIDQ3637813zbMATH OpenOpenAlexFDO

Authors Jörn Quistorff

Publication date 14 July 2009

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698106

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• scientific article; zbMATH DE number 559219
• Types and programing languages
• Type theories and object-oriented programmimg
• scientific article; zbMATH DE number 1342247
• scientific article; zbMATH DE number 53088
• Programming and Proving with Classical Types
• scientific article; zbMATH DE number 1953279
• scientific article; zbMATH DE number 1693038
• Typing in pure type systems
• scientific article; zbMATH DE number 709368

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A Lloyd theorem in weakly metric association schemes
• A course in combinatorics.
• A general formulation of error matrices (Corresp.)
• Bounds and constructions for codes correcting unidirectional errors
• Bounds on mixed binary/ternary codes
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• Diametric theorems in sequence spaces
• Error-correcting codes over an alphabet of four elements
• Factoring by subsets
• Fundamentals of Error-Correcting Codes
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Improved upper bounds on sizes of codes
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds on Lee codes
• On a generalization of both affine planes and MDS-codes with applications to experiment planning
• On covering sets and error-correcting codes
• On perfect codes and related concepts
• On the maximum number of permutations with given maximal or minimal distance
• Perfect (d,k)-codes capable of correcting single peak-shifts
• Perfect codes in graphs
• Perfect codes in the graphs O_k
• Rook domains, Latin squares, affine planes, and error-distributing codes
• Slight improvements of the Singleton bound
• Small additive quaternary codes.
• T-shift synchronization codes
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
• The Erdös-Ko-Rado Theorem for Integer Sequences
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• The complete intersection theorem for systems of finite sets
• The diametric theorem in Hamming spaces---optimal anticodes
• The linear programming bound for binary linear codes
• Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
• Upper bounds for constant-weight codes
• Upper bounds on codes correcting asymmetric errors (Corresp.)
• Upper bounds on permutation codes via linear programming

Cited in

(1)

• On Rosenbloom and Tsfasman's generalization of the Hamming space

This page was built for publication: Fundamentals of coding type problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637813)