Applications of Gaussian binomials to coding theory for deletion error correction

DOI10.1007/s00026-020-00494-4zbMath1441.94108arXiv1906.03385OpenAlexW3033119398MaRDI QIDQ2189566

Manabu Hagiwara, Justin Kong

Publication date: 16 June 2020

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.03385

zbMATH Keywords

Möbius functiongenerating functionweight distributionprimitive rootEuler functionmajor indexerror-correcting codesenumerative combinatoricspermutation codes\(q\)-binomialdeletion codeslattice path method

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some asymptotic results on \(q\)-binomial coefficients
• Strict unimodality of \(q\)-binomial coefficients
• A combinatorial proof of strict unimodality for \(q\)-binomial coefficients
• \(q\)-Bernoulli numbers and polynomials associated with Gaussian binomial coefficients
• On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths
• Lattice paths, \(q\)-multinomials and two variants of the Andrews-Gordon identities
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• Algebraic Combinatorics

This page was built for publication: Applications of Gaussian binomials to coding theory for deletion error correction