Search results for "Griesmer bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	E. J. Cheon, T. Kato, S. J. Kim	Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4-2q2-2q+1 <= d <= q4-2q2-q.	Des. Codes Cryptography	2005	DBLP DOI BibTeX RDF	projective code, linear code, projective space, Griesmer bound
2	Ivan N. Landjev, Leo Storme	A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound.	Des. Codes Cryptography	2007	DBLP DOI BibTeX RDF	51E20, AMS Classifications 05B25, 51E21
2	Heeralal Janwa, Arbind K. Lal	On Generalized Hamming Weights and the Covering Radius of Linear Codes.	AAECC	2007	DBLP DOI BibTeX RDF	Generalized Hamming weights, chain condition, generalized Griesmer bound, covering radius, cyclic codes, optimal codes, Griesmer bound
2	Tatsuya Maruta, Ivan N. Landjev, Assya Rousseva	On the Minimum Size of Some Minihypers and Related Linear Codes.	Des. Codes Cryptography	2005	DBLP DOI BibTeX RDF	minihypers, linear codes, projective spaces, Griesmer bound
2	Harold N. Ward	A Sequence of Unique Quaternary Griesmer Codes.	Des. Codes Cryptography	2004	DBLP DOI BibTeX RDF	Hermitian form, divisible code, MacWilliams identities, residual code, Griesmer bound, quaternary code
2	Kishan Chand Gupta, Palash Sarkar	Improved Construction of Nonlinear Resilient S-Boxes.	ASIACRYPT	2002	DBLP DOI BibTeX RDF	stream cipher, Resiliency, nonlinearity, S-box, algebraic degree, Griesmer bound
1	Simeon Ball, Szabolcs L. Fancsali	Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF
1	E. J. Cheon	A class of optimal linear codes of length one above the Griesmer bound.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 94B65, 05B25, 51E20, 94B05
1	Xuejun Zhao, Ruihu Li, Yingjie Lei	Classification of Quaternary [21s + 4, 3] Optimal Self-orthogonal Codes.	ITNG	2009	DBLP DOI BibTeX RDF	quaternary linear code, self-orthogonal code, optimal code, Griesmer bound
1	Xuejun Zhao, Yingjie Lei, Ruihu Li	On the Classification of Some Three Dimensional Quaternary Optimal Self-orthogonal Codes.	WKDD	2009	DBLP DOI BibTeX RDF
1	Jan De Beule, Patrick Govaerts, Anja Hallez, Leo Storme	Tight sets, weighted m -covers, weighted m -ovoids, and minihypers.	Des. Codes Cryptography	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 05B25, 51E20, 51E12, 51E22
1	Jan De Beule, Klaus Metsch, Leo Storme	Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound.	Des. Codes Cryptography	2008	DBLP DOI BibTeX RDF	51E20, 94B05, AMS Classifications 05B25, 51E21
1	Eric Z. Chen	An Explicit Construction of 2-Generator Quasi-Twisted Codes.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Eirik Rosnes	Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Simeon Ball, Elisa Montanucci	Affine blocking sets, three-dimensional codes and the Griesmer bound.	Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Andreas Klein, Klaus Metsch	Parameters for which the Griesmer bound is not sharp.	Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Ray Hill, Harold N. Ward	A geometric approach to classifying Griesmer codes.	Des. Codes Cryptography	2007	DBLP DOI BibTeX RDF	05B25, 94B65, AMS Classifications 94B27, 51E21
1	Yajing Li, Weihong Chen	On the Construction of Some Optimal Polynomial Codes.	CIS	2005	DBLP DOI BibTeX RDF
1	E. J. Cheon, T. Kato, S. Kim	On the Minimum Length of some Linear Codes of Dimension 5.	Des. Codes Cryptography	2005	DBLP DOI BibTeX RDF	MSC 2000 94B65, 05B25, 51E20, 94B05
1	Manish K. Gupta, Mahesh C. Bhandari, Arbind K. Lal	On Linear Codes over Z2s.	Des. Codes Cryptography	2005	DBLP DOI BibTeX RDF	linear codes over rings, generalized Gray map, simplex code, p-dimension, generalized Hamming weights (GHWs), Lee weight, Reed-Muller code, weight distributions, Gray image
1	Andreas Klein	On codes meeting the Griesmer bound.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	János Barát, Leo Storme	Multiple Blocking Sets in PG(n, q), n>3.	Des. Codes Cryptography	2004	DBLP DOI BibTeX RDF	multiple blocking sets, Baer subplanes, minihypers
1	Keisuke Shiromoto, Leo Storme	A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings.	Discrete Applied Mathematics	2003	DBLP DOI BibTeX RDF
1	Sandy Ferret, Leo Storme	Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa.	Des. Codes Cryptography	2002	DBLP BibTeX RDF
1	Keisuke Shiromoto, Leo Storme	A Griesmer Bound for Codes over Finite Quasi-Frobenius Rings.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Harold N. Ward	Divisibility of Codes Meeting the Griesmer Bound.	J. Comb. Theory, Ser. A	1998	DBLP DOI BibTeX RDF
1	Tatsuya Maruta	On the Achievement of the Griesmer Bound.	Des. Codes Cryptography	1997	DBLP DOI BibTeX RDF
1	Noboru Hamada, Tor Helleseth	A characterization of some {3vµ+1, 3vµ; k-1, q}-minihypers and some [n, k, qk-1 - 3qµ; q]-codes (k >= 3, q >= 5, 1 <= µ < k-1) meeting the Griesmer bound.	Discrete Mathematics	1995	DBLP DOI BibTeX RDF
1	Fumikazu Tamari	A construction of some [n, k, d; q]-codes meeting the Griesmer bound.	Discrete Mathematics	1993	DBLP DOI BibTeX RDF
1	Noboru Hamada	A characterization of some [n, k, d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry.	Discrete Mathematics	1993	DBLP DOI BibTeX RDF
1	Noboru Hamada, Tor Helleseth, Øyvind Ytrehus	A New Class of Nonbinary Codes Meeting the Griesmer Bound.	Discrete Applied Mathematics	1993	DBLP DOI BibTeX RDF
1	Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus	Generalizations of the Griesmer Bound.	Error Control, Cryptology, and Speech Compression	1993	DBLP DOI BibTeX RDF
1	Noboru Hamada, Tor Helleseth	A characterization of some {2ualpha+1+ugamma+1, 2ualpha+ugamma; k-1, 3}- minihypers and some (n, k, 3k-1 -2·3alpha-3gamma; 3)-codes (k>=3, 0<=alphaGriesmer bound.	Discrete Mathematics	1992	DBLP DOI BibTeX RDF
1	Tor Helleseth	Projective codes meeting the Griesmer bound.	Discrete Mathematics	1992	DBLP DOI BibTeX RDF
1	Noboru Hamada, Tor Helleseth, Øyvind Ytrehus	On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound.	Des. Codes Cryptography	1992	DBLP DOI BibTeX RDF
1	Habong Chung	The 2-nd Generalized Hamming Weight of Double-Error Correcting Binary BCH Codes and Their Duals Codes.	AAECC	1991	DBLP DOI BibTeX RDF
1	Noboru Hamada, Michel Deza	A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry.	Discrete Mathematics	1989	DBLP DOI BibTeX RDF
1	Peter B. Busschbach, Michiel G. L. Gerretzen, Henk C. A. van Tilborg	On the covering radius of binary, linear codes meeting the Griesmer bound.	IEEE Transactions on Information Theory	1985	DBLP DOI BibTeX RDF
1	Tor Helleseth	Further classifications of codes meeting the Griesmer bound.	IEEE Transactions on Information Theory	1984	DBLP DOI BibTeX RDF
1	Tor Helleseth	New constructions of codes meeting the Griesmer bound.	IEEE Transactions on Information Theory	1983	DBLP DOI BibTeX RDF
1	Tor Helleseth	A Characterization of Codes Meeting the Griesmer Bound	Information and Control	1981	DBLP DOI BibTeX RDF
1	Tor Helleseth, Henk C. A. van Tilborg	A new class of codes meeting the Griesmer bound.	IEEE Transactions on Information Theory	1981	DBLP DOI BibTeX RDF
1	Henk C. A. van Tilborg	On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound	Information and Control	1980	DBLP DOI BibTeX RDF