Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,026,590 papers from all fields of science
Search
Sign In
Create Free Account
Hamming weight
Known as:
Popcnt
, Popcount
The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used. It is thus equivalent to the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ARM architecture
Bar product
Bent function
Binary Golay code
Expand
Broader (1)
Coding theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Training Bit Fully Convolutional Network for Fast Semantic Segmentation
He Wen
,
Shuchang Zhou
,
+4 authors
C. Yao
arXiv.org
2016
Corpus ID: 14333937
Fully convolutional neural networks give accurate, per-pixel prediction for input images and have applications like semantic…
Expand
2016
2016
Apéry sets and Feng-Rao numbers over telescopic numerical semigroups
P. García-Sánchez
,
B. A. Heredia
,
Micah J. Leamer
arXiv.org
2016
Corpus ID: 17312975
In this manuscript we show that the second Feng-Rao number of any telescopic numerical semigroup agrees with the multiplicity of…
Expand
2014
2014
Design and Implementation of Hiding Techniques to Obfuscate Against Side-Channel Attacks on AES
Todd R. Andel
,
A. Fritzke
,
J. Humphries
,
J. McDonald
2014
Corpus ID: 61584563
Received 26 Dec. 2013, Revised 22 Feb. 2014, Accepted 25 Feb. 2014, Published 1 May 2014…
Expand
2009
2009
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
Gennian Ge
,
Y. Miao
,
Zhongxiang Yao
IEEE Transactions on Information Theory
2009
Corpus ID: 206737624
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. In order to evaluate…
Expand
2009
2009
On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings
S. López-Permouth
,
Steve Szabo
Advances in Mathematics of Communications
2009
Corpus ID: 6037123
Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This…
Expand
1997
1997
Series Parameterized Circuit Complexity and the W Hierarchy
R. Downey
1997
Corpus ID: 17578736
A parameterized problem hL; ki belongs to W [t] if there exists k computed from k such that hL; ki reduces to the weight-k satis…
Expand
1995
1995
Some new results for ternary linear codes of dimension 5 and 6
M. Eupen
IEEE Transactions on Information Theory
1995
Corpus ID: 8200026
It is proved that ternary codes with parameters [40,5,25] and [148,5,98] do not exist. A new ternary code is constructed with…
Expand
1991
1991
Comments on 'Code-division multiple-access techniques in optical fiber networks. II. Systems performance analysis' by J.A. Salehi and C.A. Brackett
I. Vajda
IEEE Transactions on Communications
1991
Corpus ID: 32268604
The commenter takes issue with certain aspects of the above-named work (see ibid., vol.37, p.834, 1989) by Salehi and Brackett…
Expand
1985
1985
On the complete decoding of binary linear codes
M. Elia
,
G. Prati
IEEE Transactions on Information Theory
1985
Corpus ID: 26757434
Complete decoding of systematic linear block codes by standard arrays with coset leaders not necessarily of minimal weight gives…
Expand
1977
1977
There is no MacWilliams identity for convolutional codes (Corresp.)
J. Shearer
,
R. McEliece
IEEE Transactions on Information Theory
1977
Corpus ID: 119063711
An example is provided of two convolutional codes that have the same transmission gain but whose dual codes do not. This shows…
Expand