An extension theorem for arcs and linear codes

An extension theorem for arcs and linear codes We prove the following generalization to the extension theorem of Hill and Lizak: For every nonextendable linear [n, k, d] q code, q = p s , (d,q) = 1, we have $$\sum\limits_{i\not \equiv 0,d(\bmod q)} {A_i > q^{k - 3} r(q),}$$ where q + r(q) + 1 is the smallest size of a nontrivial blocking set in PG(2, q). This result is applied further to rule out the existence of some linear codes over $$\mathbb{F}_4$$ meeting the Griesmer bound. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

An extension theorem for arcs and linear codes

Problems of Information Transmission, Volume 42 (4) – Jan 24, 2006
11 pages

/lp/springer_journal/an-extension-theorem-for-arcs-and-linear-codes-lhtPeLrab6
Publisher
Springer Journals
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946006040041
Publisher site
See Article on Publisher Site

Abstract

We prove the following generalization to the extension theorem of Hill and Lizak: For every nonextendable linear [n, k, d] q code, q = p s , (d,q) = 1, we have $$\sum\limits_{i\not \equiv 0,d(\bmod q)} {A_i > q^{k - 3} r(q),}$$ where q + r(q) + 1 is the smallest size of a nontrivial blocking set in PG(2, q). This result is applied further to rule out the existence of some linear codes over $$\mathbb{F}_4$$ meeting the Griesmer bound.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jan 24, 2006

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve Freelancer DeepDyve Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations

Abstract access only

18 million full-text articles

Print

20 pages / month

PDF Discount

20% off