A Characterization of q-binomials and its Application to Coding Theory

06/08/2019
by   Manabu Hagiwara, et al.
0

We present a new perspective on q-binomials, also known as Gaussian binomial coefficients. This new perspective, which is the main theorem of the paper, relates q-binomials to a type of generating function. The theorem may be applied to determine cardinalities of certain error-correcting codes based on Varshamov-Tenengolts codes. This application is related to a problem previously studied by R. P. Stanley.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2019

Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction

We present new applications on q-binomials, also known as Gaussian binom...
research
07/27/2023

Knot Theory and Error-Correcting Codes

This paper builds a novel bridge between algebraic coding theory and mat...
research
11/28/2018

Statistical Robust Chinese Remainder Theorem for Multiple Numbers: Wrapped Gaussian Mixture Model

Generalized Chinese Remainder Theorem (CRT) has been shown to be a power...
research
07/27/2022

Cubic Goldreich-Levin

In this paper, we give a cubic Goldreich-Levin algorithm which makes pol...
research
05/04/2023

Majorizing Measures, Codes, and Information

The majorizing measure theorem of Fernique and Talagrand is a fundamenta...
research
08/08/2022

Spectacularly large expansion coefficients in Müntz's theorem

Müntz's theorem asserts, for example, that the even powers 1, x^2, x^4,…...
research
04/06/2020

Strengthening of the Assmus–Mattson theorem for some dual codes

We previously proposed the first nontrivial examples of a code having su...

Please sign up or login with your details

Forgot password? Click here to reset