Results 231 to 240 of about 6,485 (259)
Some of the next articles are maybe not open access.
Lookahead Architectures for Hamming Distance and Fixed-Threshold Hamming Weight Comparators
Circuits, Systems, and Signal Processing, 2014A Hamming distance comparator (also known as $$k$$k-order comparator) compares its two operands and outputs an agreement if they differ in less than $$k$$k corresponding bits. In this paper, we introduce novel architectures for the design of Hamming distance $$k$$k comparators, for the usually adopted values 2 or 3 for $$k$$k.
Haridimos T. Vergos +2 more
openaire +1 more source
Generalized Hamming weights for linear codes
IEEE Transactions on Information Theory, 1991Summary: Motivated by cryptographical applications, the algebraic structure of linear codes from a new perspective is studied. By viewing the minimum Hamming weight as a certain minimum property of one-dimensional subcodes, a generalized notion of higher-dimensional Hamming weights is obtained.
openaire +1 more source
Solving Linear Equations Parameterized by Hamming Weight
Algorithmica, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vikraman Arvind +3 more
openaire +3 more sources
Generalized Hamming weights of BCH(3) revisited
IEEE Transactions on Information Theory, 1995Summary: We determine the first five generalized Hamming weights of 3-error-correcting primitive binary BCH-codes [see also IEEE Trans. Inf. Theory 40, 543--546 (1994; Zbl 0837.94023)].
van der Geer, G.B.M., van der Vlugt, M.
openaire +4 more sources
Influence of Error on Hamming Weights for ASCA
2018Algebraic Side-Channel Attack (ASCA) models the cryptographic algorithm and side-channel leakage from the system as a set of equations and solves for the secret key. The attack has low data complexity and can succeed in unknown plaintext/ciphertext scenarios.
Chujiao Ma +4 more
openaire +1 more source
On Asymptotic Analysis of Relative Generalized Hamming Weight
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019The relative generalized Hamming weight (RGHW) M r (C,C1) of an [n, k] (linear) code C and an [n, k 1 ] subcode C1, a generalization of generalized Hamming weight (GHW), has been applied to wiretap channel, network coding, linear ramp secret sharing, and trellis complexity, etc.
Zhuojun Zhuang +5 more
openaire +1 more source
Learning weighted Hamming distance for binary descriptors
2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013Local image descriptors are one of the key components in many computer vision applications. Recently, binary descriptors have received increasing interest of the community for its efficiency and low memory cost. The similarity of binary descriptors is measured by Hamming distance which has equal emphasis on all elements of binary descriptors.
Bin Fan 0001 +4 more
openaire +1 more source
A note on generalized Hamming weights of BCH(2)
IEEE Transactions on Information Theory, 1996Summary: We determine results for the first six generalized Hamming weights of double-error-correcting primitive binary BCH codes.
openaire +2 more sources
On the generalized Hamming weights of geometric Goppa codes
IEEE Transactions on Information Theory, 1994Summary: We study the generalized Hamming weights of geometric Goppa codes, giving a translation of these weights into arithmetical terms, concerning the arithmetic of the curve used to construct the code. We derive some results and bounds that we apply to some known codes.
openaire +1 more source