On the extendability of quasidivisible Griesmer arcs
From MaRDI portal
Publication:281312
DOI10.1007/s10623-015-0114-2zbMath1354.51013OpenAlexW1454756766MaRDI QIDQ281312
Assia Rousseva, Storme, L., Ivan N. Landgev
Publication date: 10 May 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0114-2
Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)
Related Items (7)
On the extendability of quasidivisible Griesmer arcs ⋮ On the 3-extendability of quaternary linear codes ⋮ The non-existence of \((104,22;3,5)\)-arcs ⋮ Unnamed Item ⋮ Divisible arcs, divisible codes, and the extension problem for arcs and codes ⋮ Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\) ⋮ On the characterization of \((3 \bmod 5)\) arcs
Cites Work
- On the extendability of quasidivisible Griesmer arcs
- Extension theorems for linear codes over finite fields
- An extension theorem for arcs and linear codes
- A study of \((xv_t, xv_{t-1})\)-minihypers in \(\mathrm{PG}(t,q)\)
- Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
- Codes and projective multisets
- Blocking sets and partial spreads in finite projective spaces
- The correspondence between projective codes and 2-weight codes
- Extendability of linear codes over \(\operatorname {GF}(q)\) with minimum distance \(d\), \(\operatorname {gcd}(d,q)=1\)
- An extension theorem for linear codes
- A new extension theorem for linear codes
- Multiple Blocking Sets and Arcs in Finite Planes
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- A Bound for Error-Correcting Codes
- On the extendability of linear codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the extendability of quasidivisible Griesmer arcs
