Codes from symmetric polynomials

01/06/2022
by   Mrinmoy Datta, et al.
0

We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

Subfield subcodes of Reed-Solomon codes and their duals, BCH codes, have...
research
05/22/2020

Polynomial traces and elementary symmetric functions in the latent roots of a non-central Wishart matrix

Hypergeometric functions and zonal polynomials are the tools usually add...
research
03/07/2021

LCD Codes from tridiagonal Toeplitz matrice

Double Toeplitz (DT) codes are codes with a generator matrix of the form...
research
06/14/2019

Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes

Codes that can correct up to t symmetric errors and detect all unidirect...
research
07/05/2017

Improving Content-Invariance in Gated Autoencoders for 2D and 3D Object Rotation

Content-invariance in mapping codes learned by GAEs is a useful feature ...
research
10/28/2022

The MacWilliams Identity for the Skew Rank Metric

The weight distribution of an error correcting code is a crucial statist...
research
03/28/2021

On symmetric higher-dimensional automata and bisimilarity

It is shown that a higher-dimensional automaton is hhp-bisimilar to the ...

Please sign up or login with your details

Forgot password? Click here to reset