Applications of Gaussian binomials to coding theory for deletion error correction (Q2189566): Difference between revisions

This paper studies the relation between \(q\)-binomials, also known as Gaussian binomial coefficients, and the descent moment distribution to find cardinalities of certain error-correcting codes based on VT (Varshamov-Tenengolts) codes (also known as special cases of Levensthein codes). The authors compute the cardinality of some sets related to a well-known class of sets studied by \textit{R. P. Stanley} and \textit{M. F. Yoder} [``A study of Varshamov codes for asymmetric channels'', Jet Prop. Lab. Tech. Rep. 32-1526, 14, 117--122 (1972)]. They provide an explicit formula for calculating the cardinality of the main set of interest, as well as a condition on a parameter for the set to maximize its cardinality. Another result relates the cardinality of the main set of interest to deletion spheres. The proof technique is by defining a bijection from a particular set of sequences to the appropriate set of lattice paths, leveraging well-known connections between the number of squares in the north-western side of lattice paths and \(q\)-binomials.