arXiv:math/0101134 [math.CO]AbstractReferencesReviewsResources
Performance evaluation of modulation methods: a combinatorial approach
Daniel Krob, Ekaterina Vassilieva
Published 2001-01-16Version 1
This paper is devoted to the presentation of a combinatorial approach for analyzing the performance of an important modulation protocol used in mobile telecommunications. We show in particular that a fundamental formula, in this context, is in fact highly connected with a slight modification of a very classical algorithm of Knuth that realizes a bijection between pairs of Young tableaux of conjugated shapes and $\{0,1\}$-matrices. These new considerations allowed us to obtain the very first results with respect to important specializations (for practical applications) of the performance analysis formula that we studied.
Comments: 14 pages Submitted to Formal Power Series and Algebraic Combinatorics 2001
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1806.05094 [math.CO] (Published 2018-06-13)
A combinatorial approach to scattering diagrams
A combinatorial approach to the power of 2 in the number of involutions
arXiv:1304.6743 [math.CO] (Published 2013-04-24)
A Combinatorial Approach to Quantum Error Correcting Codes