DeepAI AI Chat
Log In Sign Up

Distance Enumerators for Number-Theoretic Codes

by   Takayuki Nozaki, et al.

The number-theoretic codes are a class of codes defined by single or multiple congruences and are mainly used for correcting insertion and deletion errors. Since the number-theoretic codes are generally non-linear, the analysis method for such codes is not established enough. The distance enumerator of a code is a unary polynomial whose ith coefficient gives the number of the pairs of codewords with distance i. The distance enumerator gives the maximum likelihood decoding error probability of the code. This paper presents an identity of the distance enumerators for the number-theoretic codes. Moreover, as an example, we derive the Hamming distance enumerator for the Varshamov-Tenengolts (VT) codes.


page 1

page 2

page 3

page 4


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

This paper investigates the extended weight enumerators for the number-t...

Decoding of (Interleaved) Generalized Goppa Codes

Generalized Goppa codes are defined by a code locator set ℒ of polynomia...

Antichain Codes

A family of sets A is said to be an antichain if x⊄y for all distinct x,...

Learning a Code: Machine Learning for Approximate Non-Linear Coded Computation

Machine learning algorithms are typically run on large scale, distribute...

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 ...

Ideal-theoretic Explanation of Capacity-achieving Decoding

In this work, we present an abstract framework for some algebraic error-...