Generalized Hamming weight of Projective Toric Code over Hypersimplices

02/25/2020
by   Nupur Patanker, et al.
0

The d-th hypersimplex of R^s is the convex hull in R^s of all integral points e_i_1+e_i_2+...+e_i_d such that 1 ≤ i_1 <... < i_d≤ s where e_i is the i-th unit vector in R^s. In [1], the authors have defined projective toric code of P of degree d denoted by C_P(d) and computed its dimension and minimum distance. In this note, we compute the second generalized Hamming weight of these codes. We also calculated the r-th generalized Hamming weight (1 ≤ r ≤ dim(C_P(d))) in certain cases.

READ FULL TEXT
research
02/25/2020

Second generalized Hamming weight of Projective Toric Code over Hypersimplices

The d-th hypersimplex of R^s is the convex hull in R^s of all integral p...
research
05/28/2019

On the generalized Hamming weights of certain Reed-Muller-type codes

There is a nice combinatorial formula of P. Beelen and M. Datta for the ...
research
06/06/2018

Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code

Projective Reed-Muller codes correspond to subcodes of the Reed-Muller c...
research
07/12/2021

On the Hamming Weight Distribution of Subsequences of Pseudorandom Sequences

In this paper, we characterize the average Hamming weight distribution o...
research
10/01/2019

NESTA: Hamming Weight Compression-Based Neural Proc. Engine

In this paper, we present NESTA, a specialized Neural engine that signif...
research
07/18/2021

Rotating Binaries

This paper investigates the behaviour of rotating binaries. A rotation b...
research
10/27/2017

Revisit Fuzzy Neural Network: Demystifying Batch Normalization and ReLU with Generalized Hamming Network

We revisit fuzzy neural network with a cornerstone notion of generalized...

Please sign up or login with your details

Forgot password? Click here to reset