Sign in
RT distances and Hamming distances of constacyclic codes of length $$8p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$.
Saroj Rani
Hai Q. Dinh
Published in:
Comput. Appl. Math. (2022)
Keyphrases
</>
hamming distance
binary codes
distance measure
special case
hashing methods
hash functions
binary strings
pattern matching
error correction
hamming space
computer vision
hilbert space
euclidean distance
locality sensitive hashing
low level
pairwise
feature selection