MétaCan
Menu
Back to cohort
Record W2128354866 · doi:10.1109/wcnc.2007.133

Multidimensional Binary Repetition Codes

2007· article· en· W2128354866 on OpenAlexaff
Pavel Loskot, Norman C. Beaulieu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsHamming codeBlock codeBinary numberHamming distanceComputer scienceConcatenated error correction codeLinear codeAlgorithmBinary codeTransmission (telecommunications)Luby transform codeHamming spaceHamming boundTheoretical computer scienceMathematicsDecoding methodsArithmeticTelecommunications

Abstract

fetched live from OpenAlex

Cyclic shifts of the binary codewords in multiple dimensions are used to construct a novel class of multidimensional binary block repetition codes. This construction is well suited as an inner encoding scheme for concatenated one-dimensional outer codewords to increase their minimum Hamming distance without increasing the transmission bandwidth. Two design criteria for multidimensional binary repetition codes are given, and an efficient algorithm to search for good codes is presented. The construction is illustrated using examples of the proposed codes in two and three dimensions. The union bound on the bit-error rate is used to optimize the transmission energy distribution over the codewords to improve the transmission reliability.

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.003
Threshold uncertainty score0.010

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.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.253
Teacher spread0.241 · 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
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207