Maximum distance<tex>q</tex>-nary codes
From MaRDI portal
Publication:5737520
Cited in
(only showing first 100 items - show all)- Elliptic near-MDS codes over \(\mathbb{F}_5\)
- On covering and coloring problems for rook domains
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- Algebraic theory of block codes detecting independent errors
- At the dawn of the theory of codes
- Optimal codes, n-arcs and Laguerre geometry
- Alternating bilinear forms over GF(q)
- Bilinear forms over a finite field, with applications to coding theory
- On the Ramsey problem for multicolor bipartite graphs
- Perfect two-fault tolerant search with minimum adaptiveness
- Counting generalized Reed-Solomon codes
- Construction of high rate \(\mathcal {T}\)-direct codes
- Slight improvements of the Singleton bound
- Roos bound for skew cyclic codes in Hamming and rank metric
- A geometric characterization of minimal codes and their asymptotic performance
- Non-malleability against polynomial tampering
- Strong security of linear ramp secret sharing schemes with general access structures
- Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v] \)-additive cyclic codes
- Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- A \(p\)-adic condition on the weight of a codeword of a linear code
- Computing AES related-key differential characteristics with constraint programming
- MDS and I-perfect poset block codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Two-weight codes: upper bounds and new optimal constructions
- Theory of supports for linear codes endowed with the sum-rank metric
- A new piggybacking design for systematic MDS storage codes
- Multidimensional stochastic matrices and error-correcting codes
- Invariant sets under linear operator and covering codes over modules
- Latin hypercubes and MDS codes
- A coding scheme that increases the code rate
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
- Some matroids related to sum-rank metric codes
- A characterization of MDS codes that have an error correcting pair
- Graphical quantum error-correcting codes based on entanglement of subgraphs
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- Singleton's bound in Euclidean codes
- Feynman graphs and the large dimensional limit of multipartite entanglement
- Hypercube packings and coverings with higher dimensional rooks
- On ℤprℤps-additive codes
- Classification of MDS codes over small alphabets
- Classical codes in quantum state space
- Compact storage schemes for formatted files by spanning trees
- Maximum distance of anticodes
- Strong forms of orthogonality for sets of hypercubes
- scientific article; zbMATH DE number 3438734 (Why is no real title available?)
- Maximum distance separable codes over ℤ2 × ℤ2s
- Private information retrieval from coded databases with colluding servers
- Optimal quantum error correcting codes from absolutely maximally entangled states
- NMDS codes of maximal length over F/sub q/,8≤q≤11
- Graphical quantum low-density parity-check codes
- Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
- An equivalence based classification of [6, 3, 4] error correcting codes over GF(5)
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Maximal (\(n\),3)-arcs in PG(2,13)
- The secret life of keys: on the calculation of mechanical lock systems
- Classification of Graeco-Latin Cubes
- Codes for Distributed Storage
- A survey on proper codes
- An application of information theory and error-correcting codes to fractional factorial experiments
- A connection between coding theory and polarized partition relations
- New classes of NMDS codes with dimension 3
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- The Relation Between CENC and NEMO
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- Some new classes of additive MDS and almost MDS codes over finite fields
- Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\)
- Sets of orthogonal hypercubes of class \(r\)
- Large Hermitian hull GRS codes of any given length
- Maximum flag-rank distance codes
- An algebraic-coding equivalence to the maximum distance separable conjecture
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- The weight distributions of several classes of few-weight linear codes
- Almost MDS codes
- Classical and quantum cyclic redundancy check codes
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Error correcting codes from general linear groups
- MDS stabilizer poset codes
- Linear codes in the folded Hamming distance and the quasi MDS property
- Binary cyclic codes from permutation polynomials over \(\mathbb{F}_{2^m}\)
- Knot theory and error-correcting codes
- Shortest-path and antichain metrics
- A new family of AMDS symbol-pair constacyclic codes of length 4p and symbol-pair distance 9p
- Pooled Testing for COVID-19 Using Coding Theory
- A new path to code-based signatures via identification schemes with restricted errors
- Classification of a class of A^3MDS code and applications in secret-sharing schemes
- Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
- Deterministic replacement path covering
- Codes for adversaries: between worst-case and average-case jamming
- New constructions of optimal symbol-pair constacyclic codes of length 4p^s
- LRCS: duality, LP bounds, and field size
- Better bounds on the minimum Lee distance
- Bounds and MacWilliams identities for codes over Artinian rings
- Divisibility of Griesmer codes
- Set families: restricted distances via restricted intersections
This page was built for publication: Maximum distance<tex>q</tex>-nary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737520)