Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes

01/16/2020
by   Takayuki Nozaki, et al.
0

This paper investigates the extended weight enumerators for the number-theoretic insertion/deletion correcting codes. As a special case, this paper provides the Hamming weight enumerators and cardinalities of the non-binary VT codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2022

Binary t_1-Deletion-t_2-Insertion-Burst Correcting Codes and Codes Correcting a Burst of Deletions

We first give a construction of binary t_1-deletion-t_2-insertion-burst ...
research
02/01/2021

Distance Enumerators for Number-Theoretic Codes

The number-theoretic codes are a class of codes defined by single or mul...
research
12/23/2018

Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes

We introduce a general class of codes which includes several well-known ...
research
07/18/2021

Rotating Binaries

This paper investigates the behaviour of rotating binaries. A rotation b...
research
06/21/2018

On the weight distribution of random binary linear codes

We investigate the weight distribution of random binary linear codes. Fo...
research
11/21/2019

Efficient Querying from Weighted Binary Codes

Binary codes are widely used to represent the data due to their small st...
research
08/28/2018

An explicit formula for a weight enumerator of linear-congruence codes

An explicit formula for a weight enumerator of linear-congruence codes i...

Please sign up or login with your details

Forgot password? Click here to reset