Performance evaluation of modulation methods: a combinatorial approach

Simple item page
dc.creatorKrob, Daniel
dc.creatorVassilieva, Ekaterina
dc.date2001-01-16
dc.date.accessioned2026-07-07T04:39:41Z
dc.date.available2026-07-07T04:39:41Z
dc.descriptionThis 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.
dc.description14 pages Submitted to Formal Power Series and Algebraic Combinatorics 2001
dc.identifierhttps://arxiv.org/abs/math/0101134
dc.identifierhttp://arxiv.org/abs/math/0101134
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60767
dc.subjectCombinatorics
dc.subject05E10; 68M20
dc.titlePerformance evaluation of modulation methods: a combinatorial approach
dc.typetext

Files

Collections

arXiv