Delivery phase in cache-based wireless networks with modified LT codes
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Caching has emerged as an efficient technique to reduce delivery latency and network congestion. The focus of this paper is on content delivery in the caching-based wireless systems. In view of the fact that in such systems, users store fractional of popular contents during off-peak hours, we propose a modified version of the Luby Transform (MLT) encoding for the delivery phase to take the advantage of channel coding. The novelty of our proposed MLT encoding lies in employing the user’s partial information to create an appropriate degree distribution. To evaluate our proposed scheme, this study considers a realistic channel model inspired by the Gilbert-Elliott channel including the erasure mode and a binary symmetric channel model. The effectiveness of our MLT encoding is analyzed by the average degree and the number of encoding symbol. A comprehensive simulation evaluation is performed which shows that MLT encoding outperforms conventional LT coding in terms of the required number of encoding symbols and demonstrates a better performance on the recovered symbols. In particular, the MLT encoding, compared to the conventional LT encoding, reduces the amount of required symbols to recover the original file for at least 20%, when the user stored more than half a file.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it