Key Predistribution Schemes Based on Orthogonal Arrays with Unique Hamming Distance Distribution
Sign Up to like & getrecommendations! Published in 2020 at "Wireless Personal Communications"
DOI: 10.1007/s11277-020-07133-4
Abstract: With the deep study of the Hamming distances of orthogonal arrays (OAs), the application of OAs has penetrated into many fields, one of which is to construct the key predistribution schemes (KPSs) for distributed sensor… read more here.
Keywords: predistribution schemes; distance distribution; key predistribution; orthogonal arrays ... See more keywords
Parallel framework for dense disparity map estimation using Hamming distance
Sign Up to like & getrecommendations! Published in 2018 at "Signal, Image and Video Processing"
DOI: 10.1007/s11760-017-1150-3
Abstract: A novel framework for sparse and dense disparity estimation was designed, and the proposed framework has been implemented in CPU and GPU for a parallel processing capability. The Census transform is applied in the first… read more here.
Keywords: framework; disparity map; disparity; dense disparity ... See more keywords
Quantum sketching protocols for Hamming distance and beyond
Sign Up to like & getrecommendations! Published in 2019 at "Physical Review A"
DOI: 10.1103/physreva.99.062331
Abstract: In this work we use the concept of quantum fingerprinting to develop a quantum communication protocol in the simultaneous message passing model that calculates the Hamming distance between two $n$-bit strings up to relative error… read more here.
Keywords: quantum sketching; distance; graphs; protocol ... See more keywords
Hamming Distance Encoding Multihop Relation Knowledge Graph Completion
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.3004448
Abstract: Knowledge graphs (KGs) play an important role in many real-world applications like information retrieval, question answering, relation extraction, etc. To reveal implicit knowledge from a knowledge graph (KG), viz. knowledge graph completion (KGC), is a… read more here.
Keywords: knowledge graph; graph completion; hamming distance; knowledge ... See more keywords
Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for DNA Classification
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Access"
DOI: 10.1109/access.2022.3158305
Abstract: This paper proposes a novel Hamming distance tolerant content-addressable memory (HD-CAM) for energy-efficient in-memory approximate matching applications. HD-CAM exploits NOR-type based static associative memory bitcells, where we add circuitry to enable approximate search with programmable… read more here.
Keywords: memory; tolerant content; distance tolerant; hamming distance ... See more keywords
HBST: A Hamming Distance Embedding Binary Search Tree for Feature-Based Visual Place Recognition
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Robotics and Automation Letters"
DOI: 10.1109/lra.2018.2856542
Abstract: Reliable and efficient visual place recognition is a major building block of modern SLAM systems. Leveraging on our prior work, in this letter, we present a Hamming distance embedding binary search tree (HBST) approach for… read more here.
Keywords: place recognition; search; visual place; embedding binary ... See more keywords
A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2021.3078575
Abstract: This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of the OSD algorithm by characterizing the statistical properties, evolution and the distribution of the Hamming distance and weighted Hamming distance from… read more here.
Keywords: distance; statistics decoding; ordered statistics; distribution ... See more keywords
Compressed Communication Complexity of Hamming Distance
Sign Up to like & getrecommendations! Published in 2021 at "Algorithms"
DOI: 10.3390/a14040116
Abstract: We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties… read more here.
Keywords: hamming distance; communication complexity; complexity hamming; complexity ... See more keywords