<--- Back to Details
First PageDocument Content
Theoretical computer science / Hamming code / Linear code / Hamming weight / Hamming bound / Hamming / Walsh–Hadamard code / GV-linear-code / Coding theory / Mathematics / Notation
Date: 2010-02-11 10:03:08
Theoretical computer science
Hamming code
Linear code
Hamming weight
Hamming bound
Hamming
Walsh–Hadamard code
GV-linear-code
Coding theory
Mathematics
Notation

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

File Size: 57,50 KB

Share Document on Facebook

Similar Documents

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

DocID: 1vhu8 - View Document

RANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK CDAM Research report LSE-CDAMAbstract. We study random subgraphs of the 2-dimensional Hamming graph H

DocID: 1uXax - View Document

CDAM research report LSE-CDAMRANDOM SUBGRAPHS OF THE 2D HAMMING GRAPH: THE SUPERCRITICAL PHASE REMCO VAN DER HOFSTAD AND MALWINA J. LUCZAK Abstract. We study random subgraphs of the 2-dimensional Hamming graph H

DocID: 1uNj5 - View Document

CDAM research report LSE-CDAMTHE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH MALWINA J. LUCZAK AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i

DocID: 1uaKw - View Document

Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme Murali K. Srinivasan Department of Mathematics Indian Institute of Technology, Bombay Powai, Mumbai, INDIA

DocID: 1u94Z - View Document