Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,067,597 papers from all fields of science
Search
Sign In
Create Free Account
Hamming code
Known as:
Single-error correction, double-error detection
, Hamming coding
, SEC-DED
Expand
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code, and were invented by Richard…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
48 relations
ArVid
Block code
Burroughs large systems
Checksum
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
ANN Based Equalization using Coded Inputs in Nakagami-m Faded Channel
Bidyut Bikash Baruah
,
K. K. Sarma
2012
Corpus ID: 54664186
Equalization is often used in wireless communication to mitigate the effects of Inter Symbol Interference (ISI). The Artificial…
Expand
2011
2011
Data Hiding in Halftone Images by XOR Block-Wise Operation with Difference Minimization
Ching-Nung Yang
,
Guo-Cin Ye
,
Cheonshik Kim
KSII Transactions on Internet and Information…
2011
Corpus ID: 41132033
This paper presents an improved XOR-based Data Hiding Scheme (XDHS) to hide a halftone image in more than two halftone stego…
Expand
2011
2011
The Universality of Generalized Hamming Code for Multiple Sources
Rick Ma
,
Samuel Cheng
IEEE Transactions on Communications
2011
Corpus ID: 6974417
We consider zero-error Slepian-Wolf coding for a special kind of correlated sources known as Hamming sources. Moreover, we focus…
Expand
2009
2009
The second generalized Hamming weight for two-point codes on a Hermitian curve
M. Homma
,
Seon Jeong Kim
Des. Codes Cryptogr.
2009
Corpus ID: 32480196
The aim of this article is the determination of the second generalized Hamming weight of any two-point code on a Hermitian curve…
Expand
2007
2007
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 17th International Symposium, AAECC-17, Bangalore, India, December 16-20, 2007, Proceedings
S. Boztaş
,
Hsiao-feng Lu
International Symposium on Applied Algebra…
2007
Corpus ID: 29505527
2002
2002
Center and Distinguisher for Strings with Unbounded Alphabet
Xiaotie Deng
,
Guojun Li
,
Lusheng Wang
Journal of combinatorial optimization
2002
Corpus ID: 13232485
AbstractConsider two sets $$\mathcal{B}$$ and $$\mathcal{G}$$ of strings of length L with characters from an unbounded…
Expand
1999
1999
Nonsystematic Perfect codes
K. Phelps
,
Mike LeVan
SIAM Journal on Discrete Mathematics
1999
Corpus ID: 207081401
We investigate nonsystematic perfect binary codes of length n, establishing that nonsystematic perfect codes of length n exist…
Expand
Highly Cited
1997
Highly Cited
1997
Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes
H. Nickl
,
J. Hagenauer
,
F. Burkert
IEEE Communications Letters
1997
Corpus ID: 6608427
The authors show that the Shannon capacity limit for the additive white Gaussian noise (AWGN) channel can be approached within 0…
Expand
1997
1997
Document image compression and analysis
O. Kia
1997
Corpus ID: 58763152
Image compression usually considers the minimization of storage space as its main objective. It is desirable, however, to code…
Expand
1994
1994
Hamming Clustering: Improving Generalization in Binary Neural Networks.
M. Muselli
1994
Corpus ID: 18593405
An important reason that gives rise to current increasing interest in neural networks is undoubtedly their ability to generalize…
Expand