Binary codes with disjoint codebooks and mutual Hamming distance

Linear Binary Error Correcting Codes with Specified Minimum Hamming Distance

Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes

Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empiricallyfound convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamming-distance convolutional codes. The proposed source codes are shown to be co...

Image retrieval with binary hamming distance

This article proposes a content-based indexing and retrieval (CBIR) system based on query-by-visual-example using hierarchical binary signatures. Binary signatures are obtained through a described binarization process of classical features (color, texture and shape). The Hamming binary distance (based on binary XOR operation) is used for computing distances. This technique was tested on a real ...

Ternary Hamming and binary perfect covering codes

Given 1 1n € Z, the n-cube Q, is the graph with vertex set V : {0, l}' and ed"geset n:VT:orfi, where f' : {(r,w) e V xV: (u _ w)i:1if and only if j: i,(j:0,.'. ,n-l)), for i:0,... ,n-1. The edges of/t aresaidtohave (ortolie along) the directioni,for i 0,.. . ,n-!.Given a graph G, we say that S gVG) is a perfect dom'inating sei (or PDS) of G if every u € V(G) \ S is neighbor of exactly one verte...

Identifying and Locating- Dominating Codes in Binary Hamming Spaces Identifying and Locating-Dominating Codes in Binary Hamming Spaces

Acknowledgements First of all I want to thank my supervisor Professor Iiro Honkala for his continuous support, and patience when long breaks in research took place. Many discussions with Iiro, his collaboration, suggestions for research topics, and careful proofreading made this work possible. I also want to thank Dr. Tero Laihonen for many inspiring discussions, suggestions for research topics...