Maximum IPP Codes of Length 3

Let Q be an alphabet with q elements. For any code C over Q of length n and for any two codewords a = (a ₁, . . . , a _n ) and b = (b ₁, . . . , b _n ) in C, let ${D({\bf a, b}) = \{(x_1, . . . , x_n) \in {Q^n} : {x_i} \in \{a_i, b_i\}\,{\rm for}\,1 \leq i \leq n\}}Let Q be an alphabet with q elements. For any code C over Q of length n and for any two codewords a = (a ₁, . . . , a _n ) and b = (b ₁, . . . , b _n ) in C, let D(a, b) = {(x₁, . . . , x_n) ? Qⁿ : x_i ? {a_i, b_i} for 1 ￡ i ￡ n}{D({\bf a, b}) = \{(x_1, . . . , x_n) \in {Q^n} : {x_i} \in \{a_i, b_i\}\,{\rm for}\,1 \leq i \leq n\}}. Let C^* = è_{a, b ? C}D(a, b){C^* = {{\bigcup}_{\rm {a,\,b}\in{C}}}D({\bf a, b})}. The code C is said to have the identifiable parent property (IPP) if, for any x ? C^*{{\rm {\bf x}} \in C^*}, ?_{x ? D(a, b)}{a, b} 1 ?{{\bigcap}_{{\rm x}{\in}D({\rm a,\,b})}\{{\bf a, b}\}\neq \emptyset} . Codes with the IPP were introduced by Hollmann et al [J. Combin. Theory Ser. A 82 (1998) 21–133]. Let F(n, q) = max{|C|: C is a q-ary code of length n with the IPP}.T? and Safavi-Naini [SIAM J. Discrete Math. 17 (2004) 548–570] showed that 3q + 6 - 6 é?{q+1}ù ￡ F(3, q) ￡ 3q + 6 - é6 ?{q+1}ù{3q + 6 - 6 \lceil\sqrt{q+1}\rceil \leq F(3, q) \leq 3q + 6 - \lceil 6 \sqrt{q+1}\rceil}, and determined F (3, q) precisely when q ≤ 48 or when q can be expressed as r ² + 2r or r ² + 3r +2 for r ≥ 2. In this paper, we establish a precise formula of F(3, q) for q ≥ 24. Moreover, we construct IPP codes of size F(3, q) for q ≥ 24 and show that, for any such code C and any x ? C^*{{\rm {\bf x}} \in C^*}, one can find, in constant time, a ? C{{\rm {\bf a}} \in C} such that if x ? D (c, d){{\rm {\bf x}} \in D ({\bf c, d})} then a ? {c, d}{{\rm {\bf a}} \in \{{\rm {\bf c, d}}\}}.     

Intersections of q-ary perfect codes

The intersections of q-ary perfect codes are under study. We prove that there exist two q-ary perfect codes C ₁ and C ₂ of length N = qn + 1 such that |C ₁ ? C ₂| = k · |P _i |/p for each k ∈ {0,..., p · K ? 2, p · K}, where q = p ^r , p is prime, r ≥ 1, $n = \tfrac{{q^{m - 1} - 1}}{{q - 1}}$ , m ≥ 2, |P _i | = p ^nr(q?2)+n , and K = p ^{n(2r?1)?r(m?1)}. We show also that there exist two q-ary perfect codes of length N which are intersected by p ^nr(q?3)+n codewords.     

A construction of Gray codes inducing complete graphs

A binary Gray code G(n) of length n, is a list of all 2ⁿn-bit codewords such that successive codewords differ in only one bit position. The sequence of bit positions where the single change occurs when going to the next codeword in G(n), denoted by S(n)?s₁,s₂,…,s_2ⁿ-1, is called the transition sequence of the Gray code G(n). The graph G_G(n) induced by a Gray code G(n) has vertex set {1,2,…,n} and edge set {{s_i,s_i+1}:1?i?2ⁿ-2}. If the first and the last codeword differ only in position s_2ⁿ, the code is cyclic and we extend the graph by two more edges {s_2ⁿ-1,s_2ⁿ} and {s_2ⁿ,s₁}. We solve a problem of Wilmer and Ernst [Graphs induced by Gray codes, Discrete Math. 257 (2002) 585-598] about a construction of an n-bit Gray code inducing the complete graph K_n. The technique used to solve this problem is based on a Gray code construction due to Bakos [A. Ádám, Truth Functions and the Problem of their Realization by Two-Terminal Graphs, Akadémiai Kiadó, Budapest, 1968], and which is presented in D.E. Knuth [The Art of Computer Programming, vol. 4, Addison-Wesley as part of “fascicle” 2, USA, 2005].     

On a partition problem of Frobenius

We consider the following problem, which was raised by Frobenius: Given n relatively prime positive integers, what is the largest integer M(a₁, a₂, …, a_n) omitted by the linear form Σ_i=1ⁿa_ix_i, where the x_i are variable nonnegative integers. We give the solution for certain special cases when n = 3.     

On the binary codes with parameters of doubly-shortened 1-perfect codes

We show that any binary (n = 2 ^k − 3, 2 ^n−k , 3) code C ₁ is a cell of an equitable partition (perfect coloring) (C ₁, C ₂, C ₃, C ₄) of the n-cube with the quotient matrix ((0, 1, n−1, 0)(1, 0, n−1, 0)(1, 1, n−4, 2)(0, 0, n−1, 1)). Now the possibility to lengthen the code C ₁ to a 1-perfect code of length n + 2 is equivalent to the possibility to split the cell C ₄ into two distance-3 codes or, equivalently, to the biparticity of the graph of distances 1 and 2 of C ₄. In any case, C ₁ is uniquely embedable in a twofold 1-perfect code of length n + 2 with some structural restrictions, where by a twofold 1-perfect code we mean that any vertex of the space is within radius 1 from exactly two codewords. By one example, we briefly discuss 2 − (n, 3, 2) multidesigns with similar restrictions. We also show a connection of the problem with the problem of completing latin hypercuboids of order 4 to latin hypercubes.     

On a class of relatively prime sequences

For each natural number n, let a₀(n) = n, and if a₀(n),…,a_i(n) have already been defined, let a_i+1(n) > a_i(n) be minimal with (a_i+1(n), a₀(n) … a_i(n)) = 1. Let g(n) be the largest a_i(n) not a prime or the square of a prime. We show that g(n) ～ n and that $\text{g(n) > n + cn}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{log}\text{(n)}$ for some c > 0. The true order of magnitude of g(n) ? n seems to be connected with the fine distribution of prime numbers. We also show that “most” a_i(n) that are not primes or squares of primes are products of two distinct primes. A result of independent interest comes of one of our proofs: For every sufficiently large n there is a prime $\text{p < n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ with [$\text{n}\text{p}$] composite.     

Quasi sure quadratic variation of local times of smooth semimartingales

In this paper, we prove that the process of the quadratic variation of local times of smooth semimartingales can be constructed as the quasi sure limit of the form ∑_Δn(L_t^a_i+1n−L_t^a_in)², where Δ_n=(a_iⁿ,a_i+1ⁿ) is a sequence of subdivisions of [a,b], a_iⁿ=i(b−a)/2ⁿ+a, i=0,1,…,2ⁿ.     

Simple continued fractions for the Fredholm numbers

Let {a_i} with a₁ ≥ 2 be an infinite bounded sequence of positive integers, and d₁ = 1, d_i = ±1 for i = 2, 3,…. Let {Q_i} be another sequence defined by the recursion Q₁ = 1, Q_i = a_i?1Q_i?1^k for i = 2, 3,…, where k ≥ 2 an integer. Put C_k(a) = Σ_{i = 1}^∞d_iQ_i^?1. In this paper we shall determine the simple continued fraction expansion for the real numbers C_k(a).     

On Cycles in 3-Connected Graphs

 Let G be a 3-connected graph of order n and S a subset of vertices. Denote by δ(S) the minimum degree (in G) of vertices of S. Then we prove that the circumference of G is at least min{|S|, 2δ(S)} if the degree sum of any four independent vertices of S is at least n+6. A cycle C is called S-maximum if there is no cycle C ^′ with |C ^′∩S|>|C∩S|. We also show that if ∑⁴ _i=1 d(a _i)≥n+3+|⋂⁴ _i=1 N(a _i)| for any four independent vertices a ₁, a ₂, a ₃, a ₄ in S, then G has an S-weak-dominating S-maximum cycle C, i.e. an S-maximum cycle such that every component in G−C contains at most one vertex in S. Received: March 9, 1998 Revised: January 7, 1999     

Long range variations on the Fibonacci universal code

Fibonacci coding is based on Fibonacci numbers and was defined by Apostolico and Fraenkel (1987) [1]. Fibonacci numbers are generated by the recurrence relation Fi=Fi−1+Fi−2∀i?2 with initial terms F₀=1, F₁=1. Variations on the Fibonacci coding are used in source coding as well as in cryptography. In this paper, we have extended the table given by Thomas [8]. We have found that there is no Gopala-Hemachandra code for a particular positive integer n and for a particular value of a∈Z. We conclude that for n=1,2,3,4, Gopala-Hemachandra code exists for a=−2,−3,…,−20. Also, for 1?n?100, there is at most m consecutive not available (N/A) Gopala-Hemachandra code in GH−(4+m) column where 1?m?16. And, for 1?n?100, as m increases the availability of Gopala-Hemachandra code decreases in GH−(4+m) column where 1?m?16.     

A characterization of the groups L3(2n)

This note is concerned with finite groups in which a Sylow two-subgroup S has an elementary Abelian subgroup E of order 2²ⁿ, n≥2, such that E=A × z(S), ¦A¦=2ⁿ, and C_S(a)=E for any involutiona ∈ A. It is proved that a simple group satisfying this condition is isomorphic to L₃,(2ⁿ).     

On the uniqueness of symmetric bases in finite dimensional Banach spaces

Suppose{e _i} _i=1 ⁿ and{f _i} _i=1 ⁿ are symmetric bases of the Banach spacesE andF. Letd(E,F)≦C andd(E,l _n ² )≧n' for somer>0. Then there is a constantC _r=C_r(C)>0 such that for alla _i∈Ri=1,...,n $$C_r^{ - 1} \left\| {\sum\limits_{i = 1}^n {a_i e_i } } \right\| \leqq \left\| {\sum\limits_{i = 1}^n {a_i f_i } } \right\| \leqq C_r \left\| {\sum\limits_{i = 1}^n {a_i e_i } } \right\|$$ We also give a partial uniqueness of unconditional bases under more restrictive conditions.     

On the binary codes with parameters of triply-shortened 1-perfect codes

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary (n?=?2 ^m ? 3, 2 ^n-m-1, 4) code C, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the n-cube into six cells. An arbitrary binary (n?=?2 ^m ? 4, 2 ^n-m , 3) code D, i.e., a code with parameters of a triply-shortened Hamming code, is a cell of an equitable family (but not a partition) with six cells. As a corollary, the codes C and D are completely semiregular; i.e., the weight distribution of such codes depends only on the minimal and maximal codeword weights and the code parameters. Moreover, if D is self-complementary, then it is completely regular. As an intermediate result, we prove, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable.     

Hadamard matrices and doubly even self-dual error-correcting codes

Let n be an integer with n≡4 (mod 8). For any Hadamard matrices H_n of order n, we give a method to define a doubly even self-dual [2n, n] code C(NH_n). Then we will prove that two Hadamard equivalent matrices define equivalent codes.     

Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

The support of an [n, k] linear code C over a finite field F_q is the set of all coordinate positions such that at least one codeword has a nonzero entry in each of these coordinate position. The rth generalized Hamming weight d_r(C), 1 ⩽ r ⩽ k, of C is defined as the minimum of the cardinalities of the supports of all [n, r] subcodes of C. The sequence (d₁(C), d₂(C), … , d_k(C)) is called the Hamming weight hierarchy (HWH) of C. The HWH, d_r(C) = n − k + r;  r = 1, 2 , …, k, characterizes maximum distance separable (MDS) codes. Therefore the matrix characterization of MDS codes is also the characterization of codes with the HWH d_r(C) = n − k + r; r = 1, 2, … , k. A linear code C with systematic check matrix [I∣P], where I is the (n − k) × (n − k) identity matrix and P is a (n − k) × k matrix, is MDS iff every square submatrix of P is nonsingular. In this paper we extend this characterization to linear codes with arbitrary HWH. Using this result, we characterize Near-MDS codes, Near-Near-MDS (N²-MDS) codes and A^μ-MDS codes. The MDS-rank of C is the smallest integer η such that d_η+1 = n − k + η + 1 and the defect vector of C with MDS-rank η is defined as the ordered set {μ₁(C), μ₂(C), μ₃(C), … , μ_η(C), μ_η+1(C)}, where μ_i(C) = n − k + i − d_i(C). We call C a dually defective code if the defect vector of the code and its dual are the same. We also discuss matrix characterization of dually defective codes. Further, the codes meeting the generalized Greismer bound are characterized in terms of their generator matrix. The HWH of dually defective codes meeting the generalized Greismer bound are also reported.     

Some new results on the Littlewood-Offord problem

We consider the 2ⁿ sums of the form Σ?_ia_i with the a_i's vectors, | a_i | ? 1, and ?_i = 0, 1 for each i. We raise a number of questions about their distribution.We show that if the a_i lie in two dimensions, then at most $\text{n}\text{(}\text{n}\text{2}\text{)}$) sums can lie within a circle of diameter √3, and if n is even at most the sum of the three largest binomial coefficients can lie in a circle of diameter √5. These are best results under the indicated conditions.If two a's are more than 60° but less than 120° apart in direction, then the bound ($\text{n}\text{[}\text{n}\text{2}\text{]}$) on sums lying within a unit diameter sphere is improved to ($\text{n+1}\text{[}\text{n}\text{2}\text{]}\text{) ? 2(}\text{n?1}\text{[(n?}\text{1}\text{2}\text{)])}$.The method of Katona and Kleitman is shown to lead to a significant improvement on their two dimensional result.Finally, Lubell-type relations for sums lying in a unit diameter sphere are examined.     

Codes with the identifiable parent property for multimedia fingerprinting

Let \({\mathcal {C}}\) be a q-ary code of length n and size M, and \({\mathcal {C}}(i) = \{\mathbf{c}(i) \ | \ \mathbf{c}=(\mathbf{c}(1), \mathbf{c}(2), \ldots , \mathbf{c}(n))^{T} \in {\mathcal {C}}\}\) be the set of ith coordinates of \({\mathcal {C}}\). The descendant code of a sub-code \({\mathcal {C}}^{'} \subseteq {\mathcal {C}}\) is defined to be \({\mathcal {C}}^{'}(1) \times {\mathcal {C}}^{'}(2) \times \cdots \times {\mathcal {C}}^{'}(n)\). In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or t-MIPPC(n, M, q), so that given the descendant code of any sub-code \({\mathcal {C}}^{'}\) of a multimedia t-IPP code \({\mathcal {C}}\), one can always identify, as IPP codes do in the generic digital scenario, at least one codeword in \({\mathcal {C}}^{'}\). We first derive a general upper bound on the size M of a multimedia t-IPP code, and then investigate multimedia 3-IPP codes in more detail. We characterize a multimedia 3-IPP code of length 2 in terms of a bipartite graph and a generalized packing, respectively. By means of these combinatorial characterizations, we further derive a tight upper bound on the size of a multimedia 3-IPP code of length 2, and construct several infinite families of (asymptotically) optimal multimedia 3-IPP codes of length 2.     

On monotone functions of tree structures

Let T be a rooted tree structure with n nodes a₁,…,a_n. A function f: {a₁,…,a_n} into {1 < ? < k} is called monotone if whenever a_i is a son of a_j, then f(a_i) ≥ f(a_j). The average number of monotone bijections is determined for several classes of tree structures. If k is fixed, for the average number of monotone functions asymptotic equivalents of the form c · ?^?nn^{?$\text{3}\text{2}$} (n → ∞) are obtained for several classes of tree structures.