Asymptotical Analysis of Several Multiple Description Scenarios with L≥ 3 Descriptions
Bibliographic record
Abstract
This work compares theoretically the performance of several representative practical multiple description (MD) frameworks with L ≥ 3 symmetric descriptions. The first scenario is the classic unequal erasure protection (UEP) scheme using a successively refinable code (SRC) and Reed-Solomon codes. The second scenario is an improvement upon UEP by applying domain partitioning and permuted Reed-Solomon codes. The third scenario uses a finer partitioning and erasure correction via repetition codes. Additionally, the MD lattice vector quantizer and another recent MD scheme are considered in the comparison. The aforementioned MD schemes are compared in terms of the expected squared error asymptotically achievable as the rate R of a description approaches ∞, assuming independent description losses. Our analysis reveals that the improvement of the second scenario upon the first one when R → ∞ can reach up to 1.68 dB, but it approaches 0 as the description loss rate p goes to 0 and L approaches ∞. Additionally, we find that the first two schemes outperform the third one with an unbounded gain when R → ∞, as p→ 0 or L → ∞. Further, we show that the first three scenarios achieve unbounded improvements over the other two as R → ∞ and p → 0. On the other hand, we point out that some of the results of our asymptotic analysis rely on strong assumptions and therefore an experimental validation is needed before applying them to practical situations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.025 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".