Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction

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

We present new applications on q-binomials, also known as Gaussian binomial coefficients. Our main theorems determine cardinalities of certain error-correcting codes based on Varshamov-Tenengolts codes and prove a curious phenomenon relating to deletion sphere for specific cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2023

Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes

This manuscript presents a construction method for quantum codes capable...
research
06/08/2019

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

We present a new perspective on q-binomials, also known as Gaussian bino...
research
06/19/2019

Tutorial on algebraic deletion correction codes

The deletion channel is known to be a notoriously diffcult channel to de...
research
01/23/2019

Bit Flipping Moment Balancing Schemes for Insertion, Deletion and Substitution Error Correction

In this paper, two moment balancing schemes, namely a variable index sch...
research
07/20/2021

MUSE: Multi-Use Error Correcting Codes

In this work we present a new set of error correcting codes – Multi-Use ...
research
08/02/2022

Security of IoT Device: Perspective Forensic/Anti-Forensic Issues on Invalid Area of NAND Flash Memory

NAND flash memory-based IoT device can potentially still leave behind or...
research
07/06/2020

Descent-to-Delete: Gradient-Based Methods for Machine Unlearning

We study the data deletion problem for convex models. By leveraging tech...

Please sign up or login with your details

Forgot password? Click here to reset