the present paper aims to study the iranian-made movie “aroos-e-atash” (the bride of fire), using semiotic methodology at the three following levels: description (social codes), representation (technical codes) and ideology (ideological codes). the process of interconnections and interactions between these three types of codes resulted in these findings: although the movie enjoys an emancipatio...

Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions is either optimal or asymptotically optimal with respect to either the original Johnson bound or else a non-binary version of the Johnson bound introduced in...

Locally testable codes (LTCs) of constant minimum (absolute) distance that allow the tester to make a nearly linear number of queries have become the focus of attention recently, due to their connections to central questions in approximability theory. In particular, the binary Reed-Muller code of block length N and absolute distance d is known to be testable with O(N/d) queries, and has a dimen...

Motivated by applications in storage systems and property testing, we study data stream algorithms for local testing and tolerant testing of codes. Ideally, we would like to know whether there exist asymptotically good codes that can be local/tolerant tested with onepass, poly-log space data stream algorithms. We show that for the error detection problem (and hence, the local testing problem), ...

We study error correcting constant dimension subspace codes for network coding. The codewords are F2-subspaces of F2n , having at most 1-dimensional intersections. F2n is contained in the automorphism group of the code. We give a lower bound for the size of such codes, being constructed by a greedy method. Further we describe a code in F22m with 23m codewords, for which we finally present a con...

The asymptotic optimal performance of variable-rate vector quantizers of fixed dimension and large rate was first developed in a rigorous fashion by Paul Zador. Subsequent design algorithms for such compression codes used a Lagrangian formulation in order to generalize Lloyd’s classic quantizer optimization algorithm to variable rate codes. This formulation has been subsequently adopted in a va...

Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vectorspace. Ralf Koetter and Frank R. Kschischang [?] introduced a metric on the set af vector-spaces and showed that a minimal distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and re...

An additive quaternary [n,k,d]-code (length n, dimension k, minimum distance d) is a 2k-dimensional \mathbb F 2 -vector space of n-tuples with entries in ⊕\mathbb (the 2-dimensional vector over ) Hamming d. We determine the optimal parameters codes k ≤ 3. The most challenging case k=2.5. prove t...