The Hamming neural network is a kind of counterfeit system that substance two kinds layers (feed forward and repetitive layer). In this study, pattern entries are utilization in the binary number. first layer, nerves were as pure line work. subsequent three positive work utilization. Neural calculation was also implemented reproduction strategies (logical gate technique, programming program enc...

Free fermions on Hamming graphs H(d,q) are considered and the entanglement entropy for two types of subsystems is computed. For subsets vertices that form subgraphs, an analytical expression obtained. corresponding to a neighborhood, i.e. set sites at fixed distance from reference vertex, decomposition in irreducible submodules Terwilliger algebra also yields closed formula entropy. Finally, ma...

We prove anti-concentration bounds for the inner product of two independent random vectors, and use these to lower in communication complexity. show that if $A,B$ are subsets cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, $X \in A$ $Y B$ sampled independently uniformly, then $\langle X,Y \rangle$ takes on any fixed value probability at most $O(1/\sqrt{n})$. In fact, we following stron...

We first present an equivalent definition of relative generalized Hamming weights of a linear code and its subcodes, and we develop a method using finite projective geometry. Making use of the equivalent definition and the projective-geometry method, all of the relative generalized Hamming weights of a 3-dimensional q-ary linear code and its subcodes will be determined.

In this note, we investigate the Hamming weight enumerators of self-dual codes over F q and Zk. Using invariant theory, a basis for the space of invariants to which the Hamming weight enumerators belong for self-dual codes over F q and Zk is determined. 2

A new UEP technique for image transmission using trellis code based on Hamming distance criterion has been proposed. The simulation results comparing the image quality and bit-rate for UEP and EEP have been provided. The results show that UEP performs better than EEP in terms of bit-rate without any significant depreciation in image quality. key words: trellis code, unequal error protection, Ha...

We show that the Doob and Hamming graphs are hyper-self-dual. We then show that although the Doob graphs are formally dual to certain Hamming graphs, they are not hyper-dual to them. We do so by showing that Bose-Mesner subalgebras and Kronecker products of Bose-Mesner algebras inherit hyper-duality.

In this paper we present a decoding principle for BCH, Alternant and Goppa codes constructed through a semigroup ring, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r, i.e., whose minimum Hamming distance is 2r + 1. Key-word: Semigroup rings, BCH codes, Alternant codes, Goppa codes, modified BerlekampMassey algorithm.

Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...

'I' , :, , t The similarity subnet uses mn connections and performs a single iteration. The WTA subnet has m2 connections. With randomly generated input and memory patterns, it converges in 8(m In(mn)) iterations (Floreen 1991). Since m is exponential in n, the space and time complexity of the network is primarily due to the WTA subnet (Domany &; Orland 1987). We analyze the performance of the ...