scholarly journals Projective parameterized linear codes

2015 ◽  
Vol 23 (2) ◽  
pp. 223-240
Author(s):  
Manuel González Sarabia ◽  
Carlos Rentería Márquez ◽  
Eliseo Sarmiento Rosales
Keyword(s):  
Lower Bounds ◽  
Upper Bound ◽  
Minimum Distance ◽  
Incidence Matrix ◽  
Hilbert Function ◽  
Linear Codes ◽  
Evaluation Codes ◽  
Vanishing Ideal ◽  
Regularity Index

Abstract In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we find an upper bound for the minimum distance and, in some cases, we give some lower bounds for the regularity index and the minimum distance. These lower bounds work in several cases, particularly for any projective parameterized code associated to the incidence matrix of uniform clutters and then they work in the case of graphs.

ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES

2012 ◽  
Vol 11 (04) ◽  
pp. 1250072 ◽  
Author(s):  
ELISEO SARMIENTO ◽  
MARIA VAZ PINTO ◽  
RAFAEL H. VILLARREAL
Keyword(s):  
Finite Field ◽  
Projective Space ◽  
Complete Intersection ◽  
Linear Algebra ◽  
Upper Bound ◽  
Minimum Distance ◽  
Linear Codes ◽  
Intersection Property ◽  
Vanishing Ideal ◽  
Algebraic Invariants

Let K be a finite field and let X be a subset of a projective space, over the field K, which is parametrized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex order, of the vanishing ideal I(X) of X. If the clutter is uniform, we classify the complete intersection property of I(X) using linear algebra. We show an upper bound for the minimum distance of certain parametrized linear codes along with certain estimates for the algebraic invariants of I(X).

scholarly journals Parameterized Codes over Cycles

2013 ◽  
Vol 21 (3) ◽  
pp. 241-256 ◽  
Author(s):  
Manuel González Sarabia ◽  
Joel Nava Lara ◽  
Carlos Rentería Marquez ◽  
Eliseo Sarmíento Rosales
Keyword(s):  
Upper Bound ◽  
Minimum Distance ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Evaluation Codes ◽  
Singleton Bound ◽  
Odd Cycles

AbstractIn this paper we will compute the main parameters of the parameterized codes arising from cycles. In the case of odd cycles the corresponding codes are the evaluation codes associated to the projective torus and the results are well known. In the case of even cycles we will compute the length and the dimension of the corresponding codes and also we will find lower and upper bounds for the minimum distance of this kind of codes. In many cases our upper bound is sharper than the Singleton bound.

QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES

2011 ◽  
Vol 03 (02) ◽  
pp. 223-243
Author(s):  
CHRISTOS KOUKOUVINOS ◽  
DIMITRIS E. SIMOS
Keyword(s):  
Lower Bounds ◽  
Minimum Distance ◽  
Optimization Problem ◽  
Linear Codes ◽  
Cyclic Codes ◽  
Mathematical Structure ◽  
Combinatorial Optimization Problem ◽  
Supersaturated Designs ◽  
Statistical Designs ◽  
Quasi Cyclic Codes

In this paper, one-generator binary quasi-cyclic (QC) codes are explored by statistical tools derived from design of experiments. A connection between a structured cyclic class of statistical designs, k-circulant supersaturated designs and QC codes is given. The mathematical structure of the later codes is explored and a link between complementary dual binary QC codes and E(s2)-optimal k-circulant supersaturated designs is established. Moreover, binary QC codes of rate 1/3, 1/4, 1/5, 1/6 and 1/7 are found by utilizing a genetic algorithm. Our approach is based on a search for good or best codes that attain the current best-known lower bounds on the minimum distance of linear codes, formulated as a combinatorial optimization problem. Surveying previous results, it is shown, that our codes reach the current best-known lower bounds on the minimum distance of linear codes with the same parameters.

Algebraic Properties of Modulo q Complete ℓ-Wide Families

2009 ◽  
Vol 18 (3) ◽  
pp. 309-333 ◽  
Author(s):  
BÁLINT FELSZEGHY ◽  
GÁBOR HEGEDŰS ◽  
LAJOS RÓNYAI
Keyword(s):  
Set Theory ◽  
Upper Bound ◽  
Gröbner Basis ◽  
Hilbert Function ◽  
Grobner Basis ◽  
Vanishing Ideal ◽  
Algebraic Properties ◽  
Image Position ◽  
Extremal Set ◽  
Wide Family

Let q be a power of a prime p, and let n, d, ℓ be integers such that 1 ≤ n, 1 ≤ ℓ < q. Consider the modulo q complete ℓ-wide family: We describe a Gröbner basis of the vanishing ideal I() of the set of characteristic vectors of over fields of characteristic p. It turns out that this set of polynomials is a Gröbner basis for all term orderings ≺, for which the order of the variables is xn ≺ xn−1 ≺ ⋅⋅⋅ ≺ x1.We compute the Hilbert function of I(), which yields formulae for the modulo p rank of certain inclusion matrices related to .We apply our results to problems from extremal set theory. We prove a sharp upper bound of the cardinality of a modulo q ℓ-wide family, which shatters only small sets. This is closely related to a conjecture of Frankl [13] on certain ℓ-antichains. The formula of the Hilbert function also allows us to obtain an upper bound on the size of a set system with certain restricted intersections, generalizing a bound proposed by Babai and Frankl [6].The paper generalizes and extends the results of [15], [16] and [17].

scholarly journals Seven new champion linear codes

2013 ◽  
Vol 16 ◽  
pp. 109-117 ◽  
Author(s):  
Gavin Brown ◽  
Alexander M. Kasprzyk
Keyword(s):  
Minimum Distance ◽  
Linear Codes ◽  
Exhaustive Search ◽  
Block Length ◽  
Evaluation Codes

AbstractWe exhibit seven linear codes exceeding the current best known minimum distance $d$ for their dimension $k$ and block length $n$. Each code is defined over ${ \mathbb{F} }_{8} $, and their invariants $[n, k, d] $ are given by $[49, 13, 27] $, $[49, 14, 26] $, $[49, 16, 24] $, $[49, 17, 23] $, $[49, 19, 21] $, $[49, 25, 16] $ and $[49, 26, 15] $. Our method includes an exhaustive search of all monomial evaluation codes generated by points in the $[0, 5] \times [0, 5] $ lattice square.

Localization of Discrete Spectrum of Multiparticle Schrödinger Operators

1985 ◽  
Vol 40 (10) ◽  
pp. 1052-1058 ◽  
Author(s):  
Heinz K. H. Siedentop
Keyword(s):  
Discrete Spectrum ◽  
Lower Bounds ◽  
Upper Bound ◽  
Schrödinger Operators ◽  
Upper And Lower Bounds ◽  
Schrodinger Operators

An upper bound on the dimension of eigenspaces of multiparticle Schrödinger operators is given. Its relation to upper and lower bounds on the eigenvalues is discussed.

scholarly journals On the Interactive Capacity of Finite-State Protocols

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 17
Author(s):  
Assaf Ben-Yishai ◽  
Young-Han Kim ◽  
Rotem Oshman ◽  
Ofer Shayevitz
Keyword(s):  
Lower Bounds ◽  
Upper Bound ◽  
Noisy Channel ◽  
Shannon Capacity ◽  
Finite State

The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known lower bounds are far below the associated Shannon capacity, which serves as a trivial (and also generally the best known) upper bound. This paper considers the more restricted setup of simulating finite-state protocols. It is shown that all two-state protocols, as well as rich families of arbitrary finite-state protocols, can be simulated at the Shannon capacity, establishing the interactive capacity for those families of protocols.

Sign in / Sign up

Export Citation Format

Share Document