Hamming code

Results: 107



#Item
1Some Solutions, Homework 4, Statistical Analysis, Spring 2018 Problem 5: (from Rice) Appending three extra (binary) bits to a 4-bit word in a particular way (a Hamming Code) allows detection and correction of up

Some Solutions, Homework 4, Statistical Analysis, Spring 2018 Problem 5: (from Rice) Appending three extra (binary) bits to a 4-bit word in a particular way (a Hamming Code) allows detection and correction of up

Add to Reading List

Source URL: www.ams.jhu.edu

Language: English - Date: 2018-05-29 23:42:47
    2Switchings for codes and designs Faina I. Solov’eva Sobolev Institute of Mathematics, Novosibirsk State University,  Fq11 Magdeburg, Germany, July 22-26, 2013

    Switchings for codes and designs Faina I. Solov’eva Sobolev Institute of Mathematics, Novosibirsk State University, Fq11 Magdeburg, Germany, July 22-26, 2013

    Add to Reading List

    Source URL: www.math.uni-magdeburg.de

    Language: English - Date: 2013-08-06 10:39:43
    3Coding and Cryptography Spring 2014 Tutorial Project #1 Due at the end of class. On Friday, we learned how to decode a linear code using ‘syndromes’. Make sure someone in your working group attended class on Friday,

    Coding and Cryptography Spring 2014 Tutorial Project #1 Due at the end of class. On Friday, we learned how to decode a linear code using ‘syndromes’. Make sure someone in your working group attended class on Friday,

    Add to Reading List

    Source URL: math.colorado.edu

    Language: English - Date: 2015-10-18 16:52:38
    4Weight Distribution of Linear Error Correcting Codes Chaos Golubitsky Abstract In this paper, i will discuss a class of error-correcting codes known as BCH codes. I will give a

    Weight Distribution of Linear Error Correcting Codes Chaos Golubitsky Abstract In this paper, i will discuss a class of error-correcting codes known as BCH codes. I will give a

    Add to Reading List

    Source URL: www.glassonion.org

    Language: English - Date: 2004-07-22 22:33:41
    5CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

    CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

    Add to Reading List

    Source URL: theory.stanford.edu

    Language: English - Date: 2016-06-04 09:49:43
    6199  Documenta Math. Flinders Petrie, the Travelling Salesman Problem, and the Beginning of Mathematical Modeling

    199 Documenta Math. Flinders Petrie, the Travelling Salesman Problem, and the Beginning of Mathematical Modeling

    Add to Reading List

    Source URL: www.math.uiuc.edu

    Language: English - Date: 2012-07-29 04:14:08
    7Spectral Graph Theory  Lecture 11 Introduction to Coding Theory Daniel A. Spielman

    Spectral Graph Theory Lecture 11 Introduction to Coding Theory Daniel A. Spielman

    Add to Reading List

    Source URL: www.cs.yale.edu

    Language: English - Date: 2012-08-24 09:50:05
    8On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany

    On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany

    Add to Reading List

    Source URL: www.cits.rub.de

    Language: English - Date: 2015-02-05 05:37:41
    9Code-based Cryptography  Christiane Peters Technical University of Denmark  ECC 2011

    Code-based Cryptography Christiane Peters Technical University of Denmark ECC 2011

    Add to Reading List

    Source URL: ecc2011.loria.fr

    Language: English - Date: 2011-09-30 12:40:04
    10ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

    ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

    Add to Reading List

    Source URL: homepages.wmich.edu

    Language: English - Date: 2016-03-15 19:27:05