MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Error Correcting Code Techniques
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

812 results · 1 filter active ·
Results by year
20012025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
812 works in the cohort · of 4,299,418page 1 of 17

Labels cover 0 of 812 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 812 of 812 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Factor graphs and the sum-product algorithm
Frank R. Kschischang, Brendan J. Frey, Hans‐Andrea Loeliger
2001· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
6,481
citations
afffundunlabeled
Staircase Codes With 6% to 33% Overhead
Lei M. Zhang, Frank R. Kschischang
2014· article· en· Journal of Lightwave Technology· Computer Science
machine prediction:candidate · noneconsensus · none
240
citations
affunlabeled
Fully Parallel Stochastic LDPC Decoders
S. Sharifi Tehrani, Shie Mannor, Warren J. Gross
2008· article· en· IEEE Transactions on Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
207
citations
affunlabeled
Rateless coding over fading channels
Jeff Castura, Yongyi Mao
2006· article· en· IEEE Communications Letters· Computer Science
machine prediction:candidate · noneconsensus · none
189
citations
affunlabeled
Stochastic decoding of LDPC codes
S. Sharifi Tehrani, Warren J. Gross, Shie Mannor
2006· article· en· IEEE Communications Letters· Computer Science
machine prediction:candidate · noneconsensus · none
168
citations
affunlabeled
Fast list decoders for polar codes
Gabi Sarkis, Pascal Giard, Alexander Vardy, Claude Thibeault, Warren J. Gross
2016· article· en· Espace ÉTS (ETS)· Computer Science
machine prediction:candidate · noneconsensus · none
158
citations
affunlabeled
Fast List Decoders for Polar Codes
2015· article· en· IEEE Journal on Selected Areas in Communications· Computer Science
machine prediction:candidate · noneconsensus · none
153
citations
affunlabeled
Delayed Stochastic Decoding of LDPC Codes
Ali Naderi, Shie Mannor, Mohamad Sawan, Warren J. Gross
2011· article· en· IEEE Transactions on Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
136
citations
affunlabeled
Power Reduction Techniques for LDPC Decoders
Ahmad Darabiha, Anthony Chan Carusone, Frank R. Kschischang
2008· article· en· IEEE Journal of Solid-State Circuits· Computer Science
machine prediction:candidate · noneconsensus · none
131
citations
afffundunlabeled
Polar Codes for Classical-Quantum Channels
Mark M. Wilde, Saikat Guha
2012· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
120
citations
affunlabeled
Increasing the Throughput of Polar Decoders
Gabi Sarkis, Warren J. Gross
2013· article· en· IEEE Communications Letters· Computer Science
machine prediction:candidate · noneconsensus · none
113
citations
affunlabeled
Braided Block Codes
A.J. Feltstrom, Dmitri Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov
2009· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
95
citations
affno abstractunlabeled
Approximate inference in Boltzmann machines
Max Welling, Yee Whye Teh
2002· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affunlabeled
Efficient Search of Girth-Optimal QC-LDPC Codes
Alireza Tasdighi, Amir H. Banihashemi, Mohammad‐Reza Sadeghi
2016· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations

How this was built: Screen · Findings · About