MétaCan
Menu
Back to cohort
Record W4403393381 · doi:10.1134/s0032946024020017

Girth Analysis of Quantum Quasi-Cyclic LDPC Codes

2024· article· en· W4403393381 on OpenAlexaff
Farzane Amirzade, Daniel Panario, Mohammad‐Reza Sadeghi

Bibliographic record

VenueProblems of Information Transmission · 2024
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsCarleton University
Fundersnot available
KeywordsMathematicsGirth (graph theory)Low-density parity-check codeCombinatoricsQuantumDiscrete mathematicsAlgorithmDecoding methods

Abstract

fetched live from OpenAlex

Quantum quasi-cyclic LDPC (QQC LDPC) codes, as CSS (Calderbank, Shor, and Steane) codes, are attracting attention because of their good structure and popular channel coding schemes. Fully connected quasi-cyclic LDPC (QC-LDPC) codes with different girths which result in QQC-LDPC codes are investigated. We analytically prove that QC-LDPC codes with column weight at least 3, which yield a QQC-LDPC code, have girth at most 6. To obtain a QQC-LDPC code from QC-LDPC codes with girth more than 6 we should focus on QC-LDPC codes with column weight 2. We present an efficient and practical method to construct these codes with girth at least 8. Then, we extend our method to construct codes with column weight 2 and girth 12, thus reaching the largest possible girth.

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.001
metaresearch head score (Gemma)0.005
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: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.012
GPT teacher head0.259
Teacher spread0.247 · 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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueProblems of Information TransmissionSame topicError Correcting Code TechniquesFrench-language works237,207