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

Source URL: www.cdam.lse.ac.uk

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

Source URL: www.cdam.lse.ac.uk

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

Source URL: www.cdam.lse.ac.uk

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

Source URL: theory.stanford.edu

• Coding theory
• Error detection and correction
• Expander code
• Expander graph
• Linear code
• Hamming
• Isoperimetric inequality
• Connectivity
• Clique
• Forward error correction
• Graph
• Bipartite graph

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

Source URL: www.cs.yale.edu

• Coding theory
• Error detection and correction
• Hamming code
• Linear code
• ReedSolomon error correction
• Forward error correction
• Hamming
• GilbertVarshamov bound
• Block code
• Justesen code

1 Grid Colorings in Steganography Jessica Fridrich and Petr Lisonˇek Abstract— A proper vertex coloring of a graph is called

Source URL: www.ws.binghamton.edu

• Theoretical computer science
• Computer arithmetic
• Discrete mathematics
• Hamming code
• Steganography
• Graph coloring
• Hamming
• Coding theory
• Mathematics
• Error detection and correction

Public Lecture, IPM-Isfahan Professor Edwin van Dam Tilburg University, The Netherlands Titel:

Source URL: math.ipm.ac.ir

• Adjacency matrix
• Odd graph
• Hamming graph
• Johnson graph
• Two-graph
• Hypercube graph
• Graph theory
• Algebraic graph theory
• Distance-regular graph

ITW 2007, Lake Tahoe, California, September 2 - 6, 2007 Nonlinear Sparse-Graph Codes for Lossy Compression of Discrete Nonredundant Sources Ankit Gupta

Source URL: www.princeton.edu

• Information
• Linear code
• Binary symmetric channel
• Block code
• Entropy
• Rate–distortion theory
• Generator matrix
• Low-density parity-check code
• Hamming
• Coding theory
• Information theory
• Discrete mathematics

590 J. Chem. In$ Comput. Sci. 1995, 35, [removed]

Source URL: www.fmf.uni-lj.si

• Network theory
• Graph property
• Graph
• Shortest path problem
• Hamming graph
• Partial cube
• Table of simple cubic graphs
• Graph theory
• Mathematics
• Theoretical computer science