MétaCan
Menu
Back to cohort
Record W2123380295 · doi:10.1109/tbc.2007.912849

Combine LDPC Codes Over GF(q) With q-ary Modulations for Bandwidth Efficient Transmission

2008· article· en· W2123380295 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

VenueIEEE Transactions on Broadcasting · 2008
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsConcordia UniversityInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsLow-density parity-check codeComputer scienceAdditive white Gaussian noiseTurbo codeForward error correctionTransmission (telecommunications)Error detection and correctionDigital Video BroadcastingBandwidth (computing)Bit error rateConcatenated error correction codeAlgorithmElectronic engineeringDecoding methodsChannel (broadcasting)Block codeTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Low-density parity-check (LDPC) codes are playing more and more important role in digital broadcasting standards due to their excellent error correction performance. In this paper, we study the combination of LDPC codes over GF(q) with q-ary modulations for bandwidth efficient transmission over AWGN channel and consider the design of the codes. Specifically, we develop the concept of quasi-regular codes, and propose an improved Monte Carlo method to optimize the quasi-regular codes. To justify the performance of our proposed scheme, simulation results are presented and analysed. </para>

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.717
Threshold uncertainty score1.000

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.001
Science and technology studies0.0010.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.028
GPT teacher head0.256
Teacher spread0.228 · 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