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 (Q1209669): Difference between revisions

Latest revision as of 10:56, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	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	scientific article

Statements

instance of

scholarly article

0 references

title

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 (English)

0 references

0 references

0 references

Journal of Statistical Planning and Inference

0 references

publication date

16 May 1993

0 references

zbMATH Keywords

minihypers

0 references

codes

0 references

finite projective geometry

0 references

hyperplane

0 references

geometrical characterization

0 references

Griesmer bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5796828

0 references

Q3285034

0 references

On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes

0 references

Arcs and blocking sets. II

0 references

New bounds on binary linear codes of dimension eight (Corresp.)

0 references

A Bound for Error-Correcting Codes

0 references

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

0 references

Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes

0 references

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

0 references

Q3813825

0 references

A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs

0 references

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

0 references

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

0 references

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

0 references

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

0 references

On a geometrical method of construction of maximal t-linearly independent sets

0 references

Construction of optimal linear codes using flats and spreads in a finite projective geometry

0 references

A characterization of codes meeting the Griesmer bound

0 references

Further classifications of codes meeting the Griesmer bound (Corresp.)

0 references

Caps and codes

0 references

Q4146667

0 references

Algebraically punctured cyclic codes

0 references

A note on the construction of optimal linear codes

0 references

On linear codes which attain the Solomon-Stiffler bound

0 references

On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound

0 references

full work available at URL

https://doi.org/10.1016/0378-3758(93)90147-x

0 references

Identifiers

zbMATH Open document ID

0847.05029

0 references

DOI

10.1016/0378-3758(93)90147-X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1209669

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0378-3758(93)90147-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2090976325
@@ Property / OpenAlex ID: W2090976325 / rank @@
+Normal rank