MétaCan
Menu
Back to cohort
Record W2134379862 · doi:10.1109/icc.2005.1494428

DC-free convolutional codes and DC-free turbo codes

2005· article· en· W2134379862 on OpenAlexaff
Fengqin Zhai, I.J. Fair

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsTurbo codeConvolutional codeSerial concatenated convolutional codesComputer sciencePuncturingTurbo equalizerBCJR algorithmEncoding (memory)AlgorithmConcatenated error correction codeEncoderBlock codeElectronic engineeringDecoding methodsTelecommunicationsArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

In this paper we integrate convolutional/turbo encoding with multimode encoding to generate dc-free convolutional/turbo codes. Based on the generators of error-control codes, we employ flipping or puncturing to ensure that the coded sequences are dc-balanced. At the receiver, the channel output is first decoded by a convolutional/turbo decoder (with consideration of detection when flipping is used during encoding), and then by a dc-free decoder. We show that good spectrum performance can be obtained at the cost of an increase in complexity in the encoder and that excellent bit error rate (BER) performance can be obtained particularly when source data logic values are not equiprobable.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.012
GPT teacher head0.238
Teacher spread0.227 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations1
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207