MétaCan
Menu
Back to cohort
Record W2156492938 · doi:10.1109/bsc.2006.1644580

A Type Covering Lemma and the Excess Distortion Exponent for Coding Memoryless Laplacian Sources

2006· article· en· W2156492938 on OpenAlex
Yangfan Zhong, Fady Alajaji, L. L. Campbell

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsLemma (botany)ExponentMathematicsLossy compressionLaplace operatorDistortion (music)Coding (social sciences)Discrete mathematicsUpper and lower boundsSource codeMathematical analysisComputer scienceStatisticsBandwidth (computing)Telecommunications

Abstract

fetched live from OpenAlex

In this work, we introduce the notion of Laplacian-type class and derive a type covering lemma for the memoryless Laplacian source (MLS) under the magnitude-error distortion measure. We then present an application of the type covering lemma to the lossy coding of the MLS. We establish a simple analytical lower bound for the excess distortion exponent, namely, the exponent of the probability of representing the source beyond a given distortion threshold. It is noted that, by introducing the Laplacian-type class, one can employ the classical method of types to solve source coding and source-channel coding problems regarding the MLS

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.798
Threshold uncertainty score0.272

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.213
Teacher spread0.203 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it