Practical methods for MDC design
Bibliographic record
Abstract
Multiple-description codes are powerful tools for network-aware source coding and communication, as suggested in the previous chapters. We showed how MDC can be useful even in error-free networks. MDC, however, traditionally has been used to combat losses in packet lossy networks in which packets are likely to be dropped or lost. In this chapter, we review practical techniques for construction and optimization of MDCs. In the most general setting, an MDC scheme generating K descriptions can be regarded as a system consisting of K encoders (also called side encoders), and 2 K - 1 decoders, one for each subset of descriptions. Figure 8.1 illustrates the block diagram of an MDC scheme for three descriptions. Each encoder generates a bit stream (description) of the same source and sends it to the receiver(s). The sender does not know how many streams are received by a particular receiver, but each receiver has this information. If only some descriptions arrive at a given destination, the decoder corresponding to that subset of descriptions is used to jointly decode them. The K decoders corresponding to individual descriptions are called side decoders, while the others are termed joint decoders. Moreover, the joint decoder corresponding to the whole set of descriptions is known as the central decoder. Overview of MDC techniques Practical MD coding schemes for memoryless sources have been extensively investigated. Some of the most representative approaches are PET-based MDC, MD quantization, and MD correlating transforms. This section offers a brief overview of these three approaches.
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.002 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.018 | 0.006 |
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".