A Bound for Error-Correcting Codes
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Coprimitive sets and inextendable codes
- Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound
- Tight sets, weighted m-covers, weighted m-ovoids, and minihypers
- On optimal linear codes over \(\mathbb F_5\)
- Classification of Griesmer codes and dual transform
- On the cosets of the simplex code
- An improvement of the Griesmer bound for some small minimum distances
- Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry
- Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
- Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes
- A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
- The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
- A note on the construction of optimal linear codes
- A note on the covering radius of optimum codes
- A characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codes
- A characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound
- Projective codes meeting the Griesmer bound
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
- Optimal ternary linear codes
- A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound
- A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
- On the nonexistence of some quaternary linear codes meeting the Griesmer bound
- The nonexistence of ternary [79, 6, 51] codes
- The packing problem in statistics, coding theory and finite projective spaces
- On the minimum length of quaternary linear codes of dimension five
- A new class of nonbinary codes meeting the Griesmer bound
- New bounds for the minimum length of quaternary linear codes of dimension five
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3]\)-codes with \(B_ 2=0\)
- A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
- The extremal codes of lengths 76 with an automorphism of order 19
- On codes meeting the Griesmer bound.
- A class of negacyclic BCH codes and its application to quantum codes
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- Anticode-based locally repairable codes with high availability
- Optimal non-projective linear codes constructed from down-sets
- On some automorphisms of order 3 of the extremal binary codes
- On the sharpness of the Griesmer bound
- On the minimum size of some minihypers and related linear codes
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
- The nonexistence of ternary \([105,6,68]\) and \([230,6,152]\) codes
- A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q]\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound
- On near-MDS codes
- The nonexistence of \([71,5,46;3]\)-codes
- On linear projective codes which satisfy the chain condition.
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Nonexistence of some ternary linear codes
- Hamming distances of constacyclic codes of length 3p^s and optimal codes with respect to the Griesmer and Singleton bounds
- The \([46, 9, 20]_2\) code is unique
- Two families of subfield codes with a few weights
- A geometric characterization of minimal codes and their asymptotic performance
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
- On the nonexistence of ternary linear codes attaining the Griesmer bound
- A class of linear codes with their complete weight enumerators over finite fields
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- Few-weight quaternary codes via simplicial complexes
- New classes of binary few weight codes from trace codes over a chain ring
- On the minimum weights of binary linear complementary dual codes
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Divisible arcs, divisible codes, and the extension problem for arcs and codes
- Few-weight codes over \(\mathbb{F}_p + u \mathbb{F}_p\) associated with down sets and their distance optimal Gray image
- The geometric approach to the existence of some quaternary Griesmer codes
- Optimal minimal linear codes from posets
- LCD codes and self-orthogonal codes in finite dihedral group algebras
- New classes of \(p\)-ary few weight codes
- A geometric approach to classifying Griesmer codes
- A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound
- The weight distribution of a class of cyclic codes containing a subclass with optimal parameters
- An extended characterization of a class of optimal three-weight cyclic codes over any finite field
- A construction of linear codes and their complete weight enumerators
- A construction of q-ary linear codes with irreducible cyclic codes
- Two-weight and three-weight linear codes based on Weil sums
- Parameters for which the Griesmer bound is not sharp
- Weighted \(\{\delta (q+1),\delta ;k-1,q\}\)-minihypers
- On optimal non-projective ternary linear codes
- A classification result on weighted \(\{\delta v_{\mu +1},\delta v_{\mu};N,p^{3}\}\)-minihypers
- On weighted minihypers in finite projective spaces of square order
- On multiple caps in finite projective spaces
- On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound
- PIR codes with short block length
- Asymmetric quantum Griesmer codes detecting a single bit-flip error
- Constructing few-weight linear codes and strongly regular graphs
- Two new classes of projective two-weight linear codes
- A Griesmer bound for codes over finite quasi-Frobenius rings
- On the extendability of quasidivisible Griesmer arcs
- The use of blocking sets in Galois geometries and in related research areas
- A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field
- The non-existence of (104,22;3,5)-arcs
- On optimal linear codes of dimension 4
- SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES
- The Nonexistence of (15, 8, 5) Code
- A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
- Generalizations of the Griesmer bound
This page was built for publication: A Bound for Error-Correcting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5643872)