Two classes of linear codes and their generalized Hamming weights

05/07/2019
by   Gaopeng Jian, et al.
0

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely employing a number-theoretic approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2019

Relative Generalized Hamming weights of affine Cartesian codes

We explicitly determine all the relative generalized Hamming weights of ...
research
07/03/2018

A note on the generalized Hamming weights of Reed-Muller codes

In this note, we give a very simple description of the generalized Hammi...
research
09/12/2018

Hyperplane Sections of Determinantal Varieties over Finite Fields and Linear Codes

We determine the number of F_q-rational points of hyperplane sections of...
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...
research
06/25/2018

The Hamming and Golay Number-Theoretic Transforms

New number-theoretic transforms are derived from known linear block code...
research
04/16/2019

Equivalence classes of small tilings of the Hamming cube

The study of tilings is a major problem in many mathematical instances, ...
research
11/15/2017

Deep Epitome for Unravelling Generalized Hamming Network: A Fuzzy Logic Interpretation of Deep Learning

This paper gives a rigorous analysis of trained Generalized Hamming Netw...

Please sign up or login with your details

Forgot password? Click here to reset