Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes R. A. Bailey, Peter J. Cameron and Robert Connelly 1 Introduction The popular Sudoku puzzle was invented, with the name “number pl

Source URL: www.math.cornell.edu

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

Source URL: ecc2011.loria.fr

• Coding theory
• Information theory
• Discrete mathematics
• Cryptography
• Linear code
• Parity-check matrix
• McEliece cryptosystem
• Generator matrix
• Hamming code
• ReedSolomon error correction
• ReedMuller code
• Hamming

On  Noise  Tolerant  Learning  of  Sparse   Pari4es  and  Related  Problems   ALT  2011   Lev  Reyzin   Georgia  Ins4tute  of  Technology   work  Joint  with

Source URL: www.levreyzin.com

• Error detection and correction
• Coding theory
• Computer arithmetic
• Binary arithmetic
• Parity
• Parity bit
• Hamming
• Computing
• Computer architecture
• Mathematics

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

Source URL: homepages.wmich.edu

de Bordeaux), 27{41

Source URL: www.math.ru.nl

• Computer arithmetic
• Binary arithmetic
• Exponentials
• Coding theory
• Hamming weight
• Exponentiation by squaring
• Binary number
• Integer
• Division algorithm
• Exponentiation

1 Zigzag Codes: MDS Array Codes with Optimal Rebuilding Itzhak Tamo∗ † , Zhiying Wang∗ , and Jehoshua Bruck∗ Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA

Source URL: paradise.caltech.edu

• Coding theory
• Mathematics
• Discrete mathematics
• Erasure code
• Permutation
• MDS matrix
• Linear subspace
• Hamming code
• ReedSolomon error correction

LISTE OF PUBLICATIONS Michel Deza Beforein Moscou) 1. G´eom´etrie de Hamming des cubes unit´es (en russe) Doklady Akademii Naouk SSSR 1960, 134 (5), 1037–1040. MR 22 no 13359.

Source URL: www.liga.ens.fr

Problem set First steps in Research - Error correcting codes. 1. A [n, k, d]Σ code is perfect if for every x ∈ Σn there exists a codeword c within Hamming distance d−1 2 . Prove that the [7, 4, 3]2 Hamming code is

Source URL: tq.cs.tau.ac.il

Richard Hamming ``You and Your Research'' Transcription of the Bell Communications Research Colloquium Seminar 7 March 1986 J. F. Kaiser

Source URL: www.math.ucsd.edu

• Music industry
• 9
• Richard Hamming
• The Organ
• Music
• Sound
• Frank Sinatra: Live at Melbourne Festival Hall
• TimedText:NSApolygraphvideo.webm.en.srt

Randomness extraction and asymptotic Hamming distance Cameron E. Freer and Bjørn Kjos-Hanssen∗ Abstract We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-L¨

Source URL: cfreer.org