When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Coding theory - Wikipedia

    en.wikipedia.org/wiki/Coding_theory

    The term algebraic coding theory denotes the sub-field of coding theory where the properties of codes are expressed in algebraic terms and then further researched. [ citation needed ] Algebraic coding theory is basically divided into two major types of codes: [ citation needed ]

  3. List of algebraic coding theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_algebraic_coding...

    Download as PDF; Printable version; In other projects ... This is a list of algebraic coding theory topics. ARQ; Adler-32; Algebraic geometry code ; BCH code; BCJR ...

  4. File:Algebraic Geometric Coding Theory.pdf - Wikipedia

    en.wikipedia.org/wiki/File:Algebraic_Geometric...

    2006-11-26 07:06 Xiaodai 1240×1753× (303566 bytes) Zhuo Jia Dai's honours thesis titled "Algebraic Geometric Coding Theory".; 2006-11-26 01:00 Xiaodai 1240×1753× (303618 bytes) Zhuo jia Dai's honours thesis titled "Algebraic Geometric Coding Theory".

  5. Introduction to the Theory of Error-Correcting Codes - Wikipedia

    en.wikipedia.org/wiki/Introduction_to_the_Theory...

    This book is mainly centered around algebraic and combinatorial techniques for designing and using error-correcting linear block codes. [ 1 ] [ 3 ] [ 9 ] It differs from previous works in this area in its reduction of each result to its mathematical foundations, and its clear exposition of the results follow from these foundations.

  6. Algebraic geometry code - Wikipedia

    en.wikipedia.org/wiki/Algebraic_geometry_code

    Algebraic geometry codes, often abbreviated AG codes, are a type of linear code that generalize Reed–Solomon codes. The Russian mathematician V. D. Goppa constructed these codes for the first time in 1982.

  7. McEliece cryptosystem - Wikipedia

    en.wikipedia.org/wiki/McEliece_cryptosystem

    The original algorithm uses binary Goppa codes (subfield codes of algebraic geometry codes of a genus-0 curve over finite fields of characteristic 2); these codes can be efficiently decoded, thanks to an algorithm due to Patterson. [4] The public key is derived from the private key by disguising the selected code as a general linear code.

  8. Category:Coding theory - Wikipedia

    en.wikipedia.org/wiki/Category:Coding_theory

    Download as PDF; Printable version; ... Pages in category "Coding theory" ... List of algebraic coding theory topics; A. Algebraic geometry code; Alternant code;

  9. Singleton bound - Wikipedia

    en.wikipedia.org/wiki/Singleton_bound

    In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude upper bound on the size of an arbitrary block code with block length , size and minimum distance . It is also known as the Joshibound [ 1 ] proved by Joshi (1958) and even earlier by Komamiya (1953) .