skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 10:00 PM ET on Thursday, February 12 until 1:00 AM ET on Friday, February 13 due to maintenance. We apologize for the inconvenience.


Title: The weight hierarchy of decreasing norm-trace codes
Abstract The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II,t-resilient functions, bounding the cardinality of the output in list decoding algorithms, ramp secret sharing schemes, and quantum error correction. The generalized Hamming weights have been determined for some families of codes, including Cartesian codes and Hermitian one-point codes. In this paper, we determine the generalized Hamming weights of decreasing norm-trace codes, which are linear codes defined by evaluating sets of monomials that are closed under divisibility on the rational points of the extended norm-trace curve given by$$x^{u} = y^{q^{s - 1}} + y^{q^{s - 2}} + \cdots + y$$ x u = y q s - 1 + y q s - 2 + + y over the finite field of cardinality$$q^s$$ q s , whereuis a positive divisor of$$\frac{q^s - 1}{q - 1}$$ q s - 1 q - 1 . As a particular case, we obtain the weight hierarchy of one-point norm-trace codes and recover the result of Barbero and Munuera (2001) giving the weight hierarchy of one-point Hermitian codes. We also study the relative generalized Hamming weights for these codes and use them to construct impure quantum codes with excellent parameters.  more » « less
Award ID(s):
2401558 2201075
PAR ID:
10615684
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Springer Nature
Date Published:
Journal Name:
Designs, Codes and Cryptography
ISSN:
0925-1022
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Let$$\mathbb {F}_q^d$$ F q d be thed-dimensional vector space over the finite field withqelements. For a subset$$E\subseteq \mathbb {F}_q^d$$ E F q d and a fixed nonzero$$t\in \mathbb {F}_q$$ t F q , let$$\mathcal {H}_t(E)=\{h_y: y\in E\}$$ H t ( E ) = { h y : y E } , where$$h_y:E\rightarrow \{0,1\}$$ h y : E { 0 , 1 } is the indicator function of the set$$\{x\in E: x\cdot y=t\}$$ { x E : x · y = t } . Two of the authors, with Maxwell Sun, showed in the case$$d=3$$ d = 3 that if$$|E|\ge Cq^{\frac{11}{4}}$$ | E | C q 11 4 andqis sufficiently large, then the VC-dimension of$$\mathcal {H}_t(E)$$ H t ( E ) is 3. In this paper, we generalize the result to arbitrary dimension by showing that the VC-dimension of$$\mathcal {H}_t(E)$$ H t ( E ) isdwhenever$$E\subseteq \mathbb {F}_q^d$$ E F q d with$$|E|\ge C_d q^{d-\frac{1}{d-1}}$$ | E | C d q d - 1 d - 1
    more » « less
  2. Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension$$\ge 2$$ 2 over a finite field$${\mathbb {F}}_q$$ F q where linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates. In this paper, we propose a generalization by taking low dimensional linear systems of symmetric polynomials. Computation for small values of$$q=7,9$$ q = 7 , 9 shows that carefully chosen generalized Datta–Johnsen codes$$\left[ \frac{1}{2}q(q-1),3,d\right] $$ 1 2 q ( q - 1 ) , 3 , d have minimum distancedequal to the optimal value minus 1. 
    more » « less
  3. Abstract We extend the Calderón–Zygmund theory for nonlocal equations tostrongly coupled system of linear nonlocal equations A s u = f {\mathcal{L}^{s}_{A}u=f}, where the operator A s {\mathcal{L}^{s}_{A}}is formally given by A s u = n A ( x , y ) | x - y | n + 2 s ( x - y ) ( x - y ) | x - y | 2 ( u ( x ) - u ( y ) ) 𝑑 y . \mathcal{L}^{s}_{A}u=\int_{\mathbb{R}^{n}}\frac{A(x,y)}{|x-y|^{n+2s}}\frac{(x-%y)\otimes(x-y)}{|x-y|^{2}}(u(x)-u(y))\,dy. For 0 < s < 1 {0<1}and A : n × n {A:\mathbb{R}^{n}\times\mathbb{R}^{n}\to\mathbb{R}}taken to be symmetric and serving asa variable coefficient for the operator, the system under consideration is the fractional version of the classical Navier–Lamé linearized elasticity system. The study of the coupled system of nonlocal equations is motivated by its appearance in nonlocal mechanics, primarily in peridynamics. Our regularity result states that if A ( , y ) {A(\,\cdot\,,y)}is uniformly Holder continuous and inf x n A ( x , x ) > 0 {\inf_{x\in\mathbb{R}^{n}}A(x,x)>0}, then for f L loc p {f\in L^{p}_{\rm loc}}, for p 2 {p\geq 2}, the solution vector u H loc 2 s - δ , p {u\in H^{2s-\delta,p}_{\rm loc}}for some δ ( 0 , s ) {\delta\in(0,s)}. 
    more » « less
  4. Abstract Assuming the Riemann Hypothesis, we study negative moments of the Riemann zeta-function and obtain asymptotic formulas in certain ranges of the shift in ζ ( s ) {\zeta(s)}. For example, integrating | ζ ( 1 2 + α + i t ) | - 2 k {|\zeta(\frac{1}{2}+\alpha+it)|^{-2k}}with respect totfromTto 2 T {2T}, we obtain an asymptotic formula when the shift α is roughly bigger than 1 log T {\frac{1}{\log T}}and k < 1 2 {k<\frac{1}{2}}. We also obtain non-trivial upper bounds for much smaller shifts, as long as log 1 α log log T {\log\frac{1}{\alpha}\ll\log\log T}. This provides partial progress towards a conjecture of Gonek on negative moments of the Riemann zeta-function, and settles the conjecture in certain ranges. As an application, we also obtain an upper bound for the average of the generalized Möbius function. 
    more » « less
  5. Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ [ 0 , 1 ] k where$$k \ge 2$$ k 2 . According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ x 1 , x 2 , , x n through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ i = 1 n | x i - x i + 1 | k 1 / k c k , where$$|x-y|$$ | x - y | is the Euclidean distance betweenxandy, and$$c_k$$ c k is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ x n + 1 x 1 . From the other direction, for every$$k \ge 2$$ k 2 and$$n \ge 2$$ n 2 , there existnpoints in$$[0,1]^k$$ [ 0 , 1 ] k , such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ i = 1 n | x i - x i + 1 | k 1 / k = 2 1 / k · k . For the plane, the best constant is$$c_2=2$$ c 2 = 2 and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ c k = 9 2 3 1 / k · k for every$$k \ge 3$$ k 3 and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ c k = 2 1 / k · k , for every$$k \ge 2$$ k 2 . Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ c k = 3 5 2 3 1 / k · k or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ c k = 2.91 k ( 1 + o k ( 1 ) ) . Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ c 3 2 7 / 6 , which disproves the conjecture for$$k=3$$ k = 3 . Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 
    more » « less