MétaCan
Menu
Back to cohort
Record W2016488439 · doi:10.1109/cwit.2007.375721

Channel Code Design with Causal Side Information at the Encoder

2007· article· en· W2016488439 on OpenAlex

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
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsChannel (broadcasting)Additive white Gaussian noiseEncoderComputer scienceInterference (communication)Binary symmetric channelHamming codeHamming distanceCode (set theory)AlgorithmHamming(7,4)Binary erasure channelLinear codeBinary codeConcatenated error correction codeDecoding methodsBinary numberTheoretical computer scienceMathematicsBlock codeTelecommunicationsChannel capacityArithmetic

Abstract

fetched live from OpenAlex

The problem of channel code design for the M-ary input AWGN channel with additive discrete interference where the sequence of i.i.d. interference symbols is known causally at the encoder is considered. The code design criterion at high SNR is derived by defining a new distance measure between the input symbols of the Shannon's associated channel. For the case of binary-input channel, it is shown that it is sufficient to use only two symbols of the associated channel in the encoding as long as the distance spectrum of the code is concerned. This reduces the problem of code design for the binary-input AWGN channel with known interference to the design of binary codes for the AWGN channel with maximum Hamming distance.

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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.507
Threshold uncertainty score0.145

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.018
GPT teacher head0.239
Teacher spread0.221 · 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

Quick stats

Citations2
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicDNA and Biological ComputingFrench-language works237,207