Báo cáo toán học: "Linear Codes over Finite Chain Rings" doc

... Assertion (ii) follows from (i). 3 Linear Codes over Finite Chain Rings In this section, we introduce the basic notions of the theory of linear codes over finite chain rings. With respect to component-wise ... Linear codes over finite chain rings. In Optimal Codes and Related Topics, pages 116–126, Sozopol, Bulgaria, 1998. [21] T. Honold and I. Landjev. All Reed-Muller co...

Ngày tải lên: 07/08/2014, 06:20

... necessity to avoid equilateral triangles within an N k set) and because of the bounds set by Theorem 2. Overall, then, |M|≤1 + 2 + 4 + 5 = 12. Suppose |M| =12(andthusthatallN k sets have their largest ... either. (C) the three points belong to three different copies of M: in this case the distances are governed by the distance table of N + n, and so we cannot have an equilateral triangle since...

Ngày tải lên: 07/08/2014, 08:20

... New Graphs of Finite Mutation Type Harm Derksen ∗ Department of Mathematics University of Michigan hderksen@umich.edu Theodore ... Foundations, J. Amer. Math. Soc. 15 (2002), 497–529. [6] S. Fomin, A. Zelevinsky, Cluster algebras II: Finite type classification, In- vent. Math. 154 (2003), 63–121. [7] S. Fomin, A. Zelevinsky, Cluster

Ngày tải lên: 07/08/2014, 21:21

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 15:21

... Gray codes for H(n; C)whenn ≤ m are constructed in Section A.1. Gray codes for the latter two stagesaredescribedinSectionA.2. A.1 Gray codes when n ≤ m In this section, we construct Gray codes ... F(n; A R ). We actually construct Gray codes for the set H(n; C), thus implying Gray codes for F(n)=H(n; ). As in Section 4, the construction of Gray codes for H(n; C)has three stages...

Ngày tải lên: 07/08/2014, 06:20

... the power set of V into itself and a set of non-empty subsets of V such that {c(X) | X ∈ } is a chain and  x∈X A x ⊆  v/∈c(X) A v for any X ∈ . Then, (∗∗∗) holds. As a further corollary, a recent ... noted in [4, 5, 6], it generalizes Narushima’s inclusion-exclusion variant for posets [9], Shier’s chain formula for the reliability of a network [12, Section 6.3] and Whitney’s broken circ...

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 06:20

... between v and x. Whenever d(x, v) ≤ r,wesaythatx and vr-cover each other (or simply cover if there is no ambiguity). A set of vertices covers a vertex if at least one of its elements does. We ... Z´emor: Improved identifying codes for the grid, Electronic Journal of Combinatorics,Com- ments to 6(1), R19, 1999. [7] G. Cohen, I. Honkala, A. Lobstein, G. Z´emor: New bounds for codes identify...

Ngày tải lên: 07/08/2014, 06:23