{"id":"W2103532256","doi":"10.1109/isit.2007.4557324","title":"A class of quantum LDPC codes: construction and performances under iterative decoding","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Low-density parity-check code; Computer science; Quantum convolutional code; Quantum; Binary erasure channel; Code (set theory); Raptor code; Decoding methods; Set (abstract data type); Algorithm; Theoretical computer science; Block code; Linear code; Channel (broadcasting); Channel capacity; Computer network; Physics; Error floor; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126062,0.0004809624,0.0005765851,0.00106259,0.0009509284,0.0009888997,0.0004238262,0.0008464516,0.001579275],"category_scores_gemma":[0.002212038,0.0001792892,0.0003806317,0.0006698355,0.001004591,0.0008059097,0.0007659486,0.0008084918,0.0004597047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006056937,"about_ca_system_score_gemma":0.0006273492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007284839,"about_ca_topic_score_gemma":0.0005765642,"domain_scores_codex":[0.9995492,0.00011635,0.0000186866,0.00007825195,0.0001746211,0.00006288585],"domain_scores_gemma":[0.9989635,0.0003847887,0.0001173955,0.000277294,0.0001848361,0.00007219718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004155511,0.0002122398,0.003818597,0.0003434773,0.00007763517,0.0004442337,0.0005682871,0.1507102,0.09057532,0.6190336,0.004314307,0.1294865],"study_design_scores_gemma":[0.00008467433,0.0001932007,0.001262022,0.00005177153,0.0000308252,0.0006332378,0.00005958993,0.7522838,0.04747082,0.1886173,0.009237944,0.00007486407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3516806,0.0008758085,0.6259976,0.0005186006,0.00008722684,0.000256007,0.0006614711,0.001647901,0.01827481],"genre_scores_gemma":[0.8671658,0.0005312039,0.1285085,0.00008268021,0.00005958947,0.0002470417,0.0003102171,0.0001518956,0.00294308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001579275,"threshold_uncertainty_score":0.005283237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01120771721707466,"score_gpt":0.2515618188903275,"score_spread":0.2403541016732528,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}