A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (Q2891310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W245025004 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1107.4246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random codes: minimum distances and error exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plottable Real Number Functions and the Computable Graph Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3373046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3600690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable reals and Chaitin \(\Omega\) numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5848892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalization and computation I: motivation and background / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalisation and computation II: time cut-off and the Halting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-correcting codes and phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holomorphic supergeometry and Yang-Mills superfields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3596012 / rank
 
Normal rank

Latest revision as of 09:02, 5 July 2024

scientific article
Language Label Description Also known as
English
A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes
scientific article

    Statements

    A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (English)
    0 references
    0 references
    15 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references