{"id":"W2009853277","doi":"10.1155/asp/2006/98738","title":"Near-Capacity Coding for Discrete Multitone Systems with Impulse Noise","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Impulse noise; Erasure; Algorithm; Digital subscriber line; Gaussian noise; Coding (social sciences); Additive white Gaussian noise; Coding gain; Constant-weight code; Concatenated error correction code; Theoretical computer science; Decoding methods; Telecommunications; Channel (broadcasting); Mathematics; Block code; Artificial intelligence; Statistics","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.0007614891,0.000453087,0.0004781455,0.0004344284,0.0003565098,0.0007032278,0.000618269,0.0006481505,0.0006971692],"category_scores_gemma":[0.00309149,0.0002316484,0.0002853348,0.0004337733,0.001197095,0.0008067929,0.0009759607,0.0006875228,0.0001892679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007518328,"about_ca_system_score_gemma":0.0006689659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173989,"about_ca_topic_score_gemma":0.001027166,"domain_scores_codex":[0.9994504,0.0001618679,0.00002112546,0.00006025947,0.0002311877,0.00007521064],"domain_scores_gemma":[0.9982005,0.001199312,0.0001943849,0.0001410287,0.0002141986,0.00005043565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001236591,0.00004431767,0.0005455002,0.0001512598,0.00003687188,0.000293849,0.0002380694,0.8354754,0.02093348,0.1050526,0.0005818577,0.03652308],"study_design_scores_gemma":[0.000008028007,0.00003597962,0.0000687159,0.00001018333,0.000006034402,0.00004868334,0.00001144336,0.9798752,0.006684178,0.01258929,0.0006516813,0.000010601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08712122,0.0005455006,0.9080033,0.0002626314,0.00004193072,0.00003946772,0.00004027549,0.0001724386,0.003773281],"genre_scores_gemma":[0.8835122,0.0005493696,0.1131655,0.00007937595,0.00006479793,0.00009862673,0.00006869141,0.0000325544,0.002428939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001173989,"threshold_uncertainty_score":0.005455017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01299811936841645,"score_gpt":0.2702381345453169,"score_spread":0.2572400151769004,"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."}}