Technion - Computer Science Department - Tehnical Report CS
|
|
- Georgiana Young
- 5 years ago
- Views:
Transcription
1 TECHNION - Israel Institute of Technology Computer Science Department A CONSTRUCTION OF NON-GRS MDS by R.M. Roth and A. Lempel Technical Report #509 May 1988 CODES
2 A CONSTRUcrION OF NON-GRS MDS CODES RON M. ROTH AND ABRAHAM LEMPEL Department of Computer Science Technion, Israel Institute oftechnology Haifa Israel ABSTRACT We present a construction of long MDS codes which are not of the generalized Reed- Solomon (GRS) type. The construction employs subsets S, IS I = m, of a finite field F = GF(q) with the property that no t distinct elements ofs add up to some fixed element off. Large subsets of this kind are used to construct [n=m+,k=t+l] non-grs MDS codes over F.
3 1 I. INJ'RODUCTION An ~n,le,d] linear code over F = OF(q) is called maximum distance separable (MDS) if d = n - k + 1 [4, Ch. 11]. Some upper botmds on the lengths of MDS codes derive from the fact that, for certain ranges of k, n, and q, every MQS code must be a generalized Reed-Solomon (GRS) code, i.e., generated by <Xo al <Xn-. RS = 0. V, (), ~-I k-i k-i 1 al an- where the ai e F are distinct and V is a dia~onal, nonsingular matrix [3][5]. A "set S ~ F of size m is called an (m,t,8)-set in F if there exists an element 8 e F such that no t elements of S sum to 8. In this paper we present a construction which produces an [m+,t+1] MDS code which is not GRS from any given (m,t,8)-set in F, m ~ t +. As a method for obtaining long non-grs MDS code"s, the suggested construction reduces to the combinatorial problem of finding the largest (m,t,8)-set in OF (q ) for given t and q. Lower bounds on the cardinality of such sets are derive4 ill: Section III. For related work and references see, for instance, [1]. ll. A CONSTRUCTION OF NON-GRS CODES Let n and k be two intc!gers such th~t k ~ 3 and k + 3 S; n S;.q +. Consider the [n,ie] code over F generated by the matrix o = ~-l af-i where the ai are distinct elements of F and 8 e F. First we show that 0 does not generate a
4 GRS code; then we prove that G generates an MDS code if and only if the ai form an (n-,k-l,8)-set in F. Let k-l. gi(x)=:egijx J ~ II (x.-aj),os;is;k-l, j=o OSjst-1 : j",i and let P =[gij]osijsk-i' Consider the matrix G ~P'G = ~AA], where A= [Aij]OSijSk-1 consists of the first k columns of G. By th~ definition ofp, Aij = gi(aj ) and, therefore, A is a diagonal matrix with AU = gi(d i ) ~ O. One can easily v~rify that the-last three columns ofa are given by A = a a.,.-3 - OQ a a.,.-3 - at a a.,.-3 - ak-l where a ~ nik~l (a.,.-3 - ai) ~ 0 and b ~ 8 - :Eik~l 1 b +OQ 1 b + al 1 b + ak-l ai' To prove that G does not generate a GRS code, it suffices to show that A = [aij]' and therefore A, is not a Cauchy matrix [4, p. 33]; that is, there exist no nonzero ci and dj, distinct Xi...and distinct Yj such that Cidj au =,OS; i S; k - 1, 0 S; j S;n -k-1, x +y' & J possibly with one of the columns (rows) of A having the form doo(co ci... Ct-l)' (coo(do d l... d n - k - l»[6]. Lemma 1. [5]. Given a k x r Cauchy matrix A = [aij] over F = GF (q), we can always assume aoj = d j and alj = djyj-l, 0 S;j :S; r-l.
5 3 Applying Lemma 1 to A, after a permutation of columns and transposition, we can assume d j = 1 andyj = a- 1 (a"'_3 - aj)' 0 ~j ~ k-l, so that for some C ~ 0 and x, or c d _~J_ x +Yj C a- 1 (<Xn_3 - aj) + x = b+a., O~j~k,-I, '} = b + aj' 0 ~j ~ k - 1. Regarding (1) as a quadratic equation'in aj' it has at most < k solutions. Now, for G to generate an MDS code, every set of k columns of G must be linearly independent. It suffices to check only sets of k columns containing u = ( S)' but not Uoo = ( )'. Consider a k 'x k matrix B consisting of u and any k - 1 columns of G but Uoo' Without loss of generality, we may write B = aj- 1 af-l 1 0 Let Ai be the coefficient ofxi in the polynomial det(b (x», where B(x) = 1 1 ao 0. 1 aj- 1 k-l ak- X k-l k-l ak- X Then, det(b) = A k - + S A k _ 1 By the Vandennonde fonn ofb (x), we Qave (1) k~ k~ LAix i = IT (aj-ai) IT (x-ai)' i=o OSi <jslc- i=o k~ k~ Thus, Ak- 1 ~ 0, Ak- = -Ak- 1 L'a;, and det(b) ~ 0 if and only if L ai ~ S. Therefore, G geni=o ;=0 etates an MDS code if and only if the ai fonn an (n -,k-i,s)-set.
6 4 TIl. DERIVATION OF LOWER BOUNDS Let 8 (t,q,b) denote a largest (m,t,b)':set' in GF'(q), let M (t,q,b) = 18 (t,q,b) I, and let M (t,q) ~ max5 e F M (t,q,b). Our objective is to obtain lower bounds on M (t,q) which, by the construction of Section n, provide lower bounds on the maximal length of non-grs MDS codes. Lemma. If(t,q) = 1, then M (t,q,b) = M (t,q)for all Be GF(qj. Proof. Let BI and'~ be two distinct elements of F and let 8 I be an (m,t,bi)-set in F, where (t,q ) = 1. Consider the set 8 ~ ( a + rl(~ - B I ) a e 8 I }. Clearly, 8 is an (m,t,~)-set, implying M (t,q,b I ) ~ M (t,q,~). As B I and ~ are arbitrary elements off, the value ofm (t,q,b) is independent ofa. 0 Thus, when (t,q) = 1, it suffices to examine the values of,..say, M (t,q,0) in order to obtain lower bounds on M (t,q ). Clearly, M(l,q) =q-l for every.g, since we may set 8(I,q,0) =F - {OJ and no (m,i,o) set may contain the zero element Also, M (q -1,q ) = q -1 with 8 (q -1,q,0) = F - {a} for any a e F - (OJ. For ~ t ~ q- we distinguish between even and odd q and begin with the even case. Lemma 3. For q = h, h ~, M(,q) =q. Proof. No two distinct elements off sum to zero. 0 For a set 8 ~ F, denote by CJ(8) the sum of elements of 8. Note that every (m,t,b)-set 8, t < m, is also an (m,m-t,cj(8 )~)-set. Lemma 4. For q = h and 3 ~ t :s: i-,
7 5 Proof. M(t,q) ~!l. + i!l. if t e (3,f-) if 3 < t <!l.- Let n = {CJ>j }jh;:;l'be a basis of F = OF (q), when viewed as a vector-space of dimension hover :OF(), and associate (aoal... ah-l) e OF()h with a='ll',;/ajcj>j' Assume, first, that t is' odd. In this case the 'elements of odd Hamming weight form a (i,t,0) set, since the weight of the sum of any odd number of such elements must be odd and, therefore, nonzero. The same construction yields a (!L,t,CJ>O>-set for even t. In the special case of - t e {3,f-}, we can join the zero element to form a (I+1,t,D)-set. 0 Remark. Lemma 4 can 'be shown to hold with equality. As the full proof is rather tedious, we present here only the case t = 3. Suppose there exists a (f+,3,~)-set S. Let a e S - (~) and define T ~ S - (a). Since IT I >I' there exist distinct ~, ye T such that ~+y=~+a, implying cr({a,~,y}) = ~, in contradiction to the defmition ofs. Lemma 5. For q = h andf -1 S t S q -, M (t,q) =t +. Proof. Every (t+,,0)-set S is also a (t+,t,cr(s»-set, so that M (t,q) ~ t +. On the other hand, if there were a (t+3,t,~)-set S, it would also serve as a (t+3,3,cr(s)-<;)-set, implying t S M (3,q) - 3 = f-, contrary to the stated range of t. 0 The given lower bounds on M (t,q) guarantee the existence of [n,ie] non-grs MDS codes over OF (q), q = h, for the following values ofn and k :
8 6 k 3 4 5Sk Sf-!L-l!L Sk Sq-l n q +!L+3!l. +!L+3 k +3 These are not necessarily the longest possible codes with the said properties. For example, when q = h, h ~ 7, there exists a [q+l,4,q-] non-grs code [3, 5(3)], which can be utilized to construct [k+4,k,5] non-grs codes forf S k S q-3. We turn now to finite fields of odd size. Lemma 6. Let q be a power ofan oddprime. The,i, q + 1 M(,q)=. Proof. Let {(Xj }['~l denote the elements off so that <Xo = 0 and (Xi = -aq-i' 1SiS q~ 1, and let S = {(Xi }j~q-l). Clearly, S is a,( q;1,,o)-set in F, implying M(,q) ~ q;1. To show equality, note that any set S' r;, F of size greater than q;j must contain both (Xi and (Xq-i for some i, 1SiS q~l. 0 The following is the analog oflemma 5 for odd values ofq.!l=.!. Lemma 7. Let q be a power ofan oddprime. Then,for S t S q -, M (t,q) = t + 1. Proof. Every (t+l,i,o)-set S is also a (t+l,t,o(s»-set. The proofof tightness is similar to that in Lemma 5. 0
9 7 It is easy to see that the construction of Section IT cannot be used to obtain non-grs MDS codes for k ~ q;l. There exists however an example of a [10,5,6] non-grs construction over GF (9) [3] and it would be nice to have a general construction of non-grs MDS codes also for this range ofk.!j. Lemma 8. Let q be a power ofan oddprime. Then. for 3 S t S M (t,q ) ~ t +. Proof. Any (t+,,o)-set S is also a (t+,t,cj(s»-set. 0 In specific cases, one can do much better than that. Consider first the case q = p, an odd prime. Here we have by taking the set M (3,p) ~ Lp ; 7 J ~ r, S = { ±1, ±3, ±S,..., ±(r-l) }. The bound M (t,p) ~Lp ~ 1 + t; 1 J is easy to obtain also for larger t. For small p we have the p-3 following values ofm (t,p ), 3 S t S --: t M(t,11) M(t,13) M(t,17) M(t,19) M(t,3) Considering extension fields GF (q), q = P 11, and t S!l., we have M (t,q ) ~!l. by taking p P the elements of GF (q) whose leading coefficient is 1 when viewed as h -vectors over GF (p ). Furthermore, for 3 S t S P - 1 we have M (t,q) ~ Ll!..J.!l. by taking all h -vectors with leading t p
10 8 coefficients a, 1 S; a S;Ll!..J. t These lower bounds on M (t,q) yield non-grs MDS constructions for the following values of n and k over GF(q), q odd: for k = 3 we obtain a [q;5,3] non-grs MDS code; a special case of this construction for q == 3 (mod 4) results in a code which is known to be a complete arc: appending any column to its generator matrix violates the MDS property [, p. 15]. Applying Lemma 8, we obtain a [k+3,k,4] non-grs code for all 4 S; k S; q;1.for small values of k longer codes can be obtained; when k = 4, fo~ instance, the non-grs construction yields a code whose length is of the order t. When GF (q) is an extension field of characteristic p, [;+,k] non-grs MDS codes exist for all k S;!L - 1. p REFERENCES [1] G.T. Diderrich, H.B. Mann, "Combinatorial problems in finite Abelian groups", A Survey of Combinatorial Theory, J.N. Srivastava et al. (Ed.), North-Holland, Amsterdam, [J lw.p. Hirschfeld, Projective Geometries over Finite Fields, Clarendon Press, Oxford, [3] lw.p. Hirschfeld, "Maximal sets in finite projective spaces", Surveys in Combinatorics, E.K. Lloyd (Ed.), LMS Lecture Notes Series 8, Cambridge University Press, Cambridge, 1983, pp [4] F.J. MacWilliams, NJ.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, [5] R.M. Roth, A. Lempel, "On MDS codes v~ Cauchy matrices", submitted for publication. [6] R.M. Roth, G. Seroussi, "On generator matrices ofmds codes", IEEE Transactions on Information Theory, vol. IT-31, 1985, pp
Extending MDS Codes. T. L. Alderson
Extending MDS Codes T. L. Alderson Abstract A q-ary (n,k)-mds code, linear or not, satisfies n q + k 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show
More informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More informationAn Addition Theorem Modulo p
JOURNAL OF COMBINATORIAL THEORY 5, 45-52 (1968) An Addition Theorem Modulo p JOHN E. OLSON The University of Wisconsin, Madison, Wisconsin 53706 Communicated by Gian-Carlo Rota ABSTRACT Let al,..., a=
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More informationAn Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015
An Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015 D. Capodilupo 1, S. Freedman 1, M. Hua 1, and J. Sun 1 1 Department of Mathematics, University of Michigan Abstract A central
More informationChapter 4. Matrices and Matrix Rings
Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,
More informationA Combinatorial Bound on the List Size
1 A Combinatorial Bound on the List Size Yuval Cassuto and Jehoshua Bruck California Institute of Technology Electrical Engineering Department MC 136-93 Pasadena, CA 9115, U.S.A. E-mail: {ycassuto,bruck}@paradise.caltech.edu
More informationArithmetic Progressions with Constant Weight
Arithmetic Progressions with Constant Weight Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel e-mail: raphy@oranim.macam98.ac.il Abstract Let k n be two positive
More informationChapter 6 Lagrange Codes
Chapter 6 Lagrange Codes 6. Introduction Joseph Louis Lagrange was a famous eighteenth century Italian mathematician [] credited with minimum degree polynomial interpolation amongst his many other achievements.
More informationSPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES
SPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES N. J. A. SLOANE Abstract. Bose-Chaudhuri-Hocquenghem and Justesen codes are used to pack equa spheres in M-dimensional Euclidean space with density
More informationOn Subsets with Cardinalities of Intersections Divisible by a Fixed Integer
Europ. J. Combinatorics (1983) 4,215-220 On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer P. FRANKL AND A. M. ODLYZKO If m(n, I) denotes the maximum number of subsets of an n-element
More informationSecret-sharing with a class of ternary codes
Theoretical Computer Science 246 (2000) 285 298 www.elsevier.com/locate/tcs Note Secret-sharing with a class of ternary codes Cunsheng Ding a, David R Kohel b, San Ling c; a Department of Computer Science,
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationarxiv: v4 [cs.it] 14 May 2013
arxiv:1006.1694v4 [cs.it] 14 May 2013 PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION MARTIANUS FREDERIC EZERMAN Centre for Quantum Technologies, National University
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationJournal of Discrete Mathematical Sciences & Cryptography Vol. 9 (2006), No. 1, pp
Some generalizations of Rédei s theorem T. Alderson Department of Mathematical Sciences University of New Brunswick Saint John, New Brunswick Canada EL 4L5 Abstract By the famous theorems of Rédei, a set
More informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More informationM.D.S. Codes and Arcs in PG(n, q) with q Even: An Improvement of the Bounds of Bruen, Thas, and Blokhuis
JOURNAL OF COMBINATORIAL THEORY, Series A 62, 139-154 (1993) M.D.S. Codes and Arcs in PG(n, q) with q Even: An Improvement of the Bounds of Bruen, Thas, and Blokhuis L. STORME* AND J. A. THAS Seminar of
More informationMatrix characterization of linear codes with arbitrary Hamming weight hierarchy
Linear Algebra and its Applications 412 (2006) 396 407 www.elsevier.com/locate/laa Matrix characterization of linear codes with arbitrary Hamming weight hierarchy G. Viswanath, B. Sundar Rajan Department
More informationAunu Integer Sequence as Non-Associative Structure and Their Graph Theoretic Properties
Advances in Pure Mathematics, 2016, 6, 409-419 Published Online May 2016 in SciRes. http://www.scirp.org/journal/apm http://dx.doi.org/10.4236/apm.2016.66028 Aunu Integer Sequence as Non-Associative Structure
More informationSolutions to Assignment 3
Solutions to Assignment 3 Question 1. [Exercises 3.1 # 2] Let R = {0 e b c} with addition multiplication defined by the following tables. Assume associativity distributivity show that R is a ring with
More informationIdempotent Generators of Generalized Residue Codes
1 Idempotent Generators of Generalized Residue Codes A.J. van Zanten A.J.vanZanten@uvt.nl Department of Communication and Informatics, University of Tilburg, The Netherlands A. Bojilov a.t.bozhilov@uvt.nl,bojilov@fmi.uni-sofia.bg
More informationM 2 + s 2. Note that the required matrix A when M 2 + s 2 was also obtained earlier by Gordon [2]. (2.2) x -alxn-l-aex n-2 an
SIAM J. ALG. DISC. METH. Vol. 1, No. 1, March 1980 1980 Society for. Industrial and Applied Mathematics 0196-52/80/0101-0014 $01.00/0 ON CONSTRUCTION OF MATRICES WITH DISTINCT SUBMATRICES* SHARAD V. KANETKAR"
More informationNew Traceability Codes against a Generalized Collusion Attack for Digital Fingerprinting
New Traceability Codes against a Generalized Collusion Attack for Digital Fingerprinting Hideki Yagi 1, Toshiyasu Matsushima 2, and Shigeichi Hirasawa 2 1 Media Network Center, Waseda University 1-6-1,
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationBounds for binary codes with narrow distance distributions
Bounds for binary codes with narrow distance distributions Ron M Roth, Gadiel Seroussi Advanced Studies HP Laboratories Palo Alto HPL-006-136 September 9, 006* constant-weight codes, distance distribution,
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More informationAn Exponential Number of Generalized Kerdock Codes
INFORMATION AND CONTROL 53, 74--80 (1982) An Exponential Number of Generalized Kerdock Codes WILLIAM M. KANTOR* Department of Mathematics, University of Oregon, Eugene, Oregon 97403 If n- 1 is an odd composite
More informationLIFTED CODES OVER FINITE CHAIN RINGS
Math. J. Okayama Univ. 53 (2011), 39 53 LIFTED CODES OVER FINITE CHAIN RINGS Steven T. Dougherty, Hongwei Liu and Young Ho Park Abstract. In this paper, we study lifted codes over finite chain rings. We
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationAverage Coset Weight Distributions of Gallager s LDPC Code Ensemble
1 Average Coset Weight Distributions of Gallager s LDPC Code Ensemble Tadashi Wadayama Abstract In this correspondence, the average coset eight distributions of Gallager s LDPC code ensemble are investigated.
More informationFibonacci Numbers and some Applications to Digital Image Scrambling
MATH491 Summer Research Project 2006-2007 Fibonacci Numbers and some Applications to Digital Image Scrambling Benjamin Williams Department of Mathematics and Statistics University of Canterbury Fibonacci
More informationOn the intersection of Hermitian surfaces
On the intersection of Hermitian surfaces Nicola Durante and Gary Ebert Abstract In [6] and [3] the authors determine the structure of the intersection of two Hermitian surfaces of PG(3, q 2 ) under the
More informationOn the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes over GF(q)
INFORMATION AND CONTROL 16, 396-401 (1970) On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes over GF(q) J. H. VAN LINT Technological University Eindhoven, Netherlands Received December
More informationMaximum Distance Separable Symbol-Pair Codes
2012 IEEE International Symposium on Information Theory Proceedings Maximum Distance Separable Symbol-Pair Codes Yeow Meng Chee, Han Mao Kiah, and Chengmin Wang School of Physical and Mathematical Sciences,
More informationCONDITIONS ON POLYNOMIALS DESCRIBING AN OVAL IN PG(2, q)
CONDITIONS ON POLYNOMIALS DESCRIBING AN OVAL IN PG(2, q) TIMOTHY L. VIS Abstract. An oval in a finite projective plane of order q is a set of q+1 points such that no three of the points lie on a common
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationCOMPARING PERIODIC ORBITS OF MAPS OF THE INTERVAL
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 333, Number 2, October 1992 COMPARING PERIODIC ORBITS OF MAPS OF THE INTERVAL C. BERNHARDT, E. COVEN, M. MISIUREWICZ, AND I. MULVEY Abstract. Let
More informationarxiv: v5 [math.co] 26 Apr 2013
A WEAK VERSION OF ROTA S BASIS CONJECTURE FOR ODD DIMENSIONS arxiv:0.830v5 [math.co] 26 Apr 203 RON AHARONI Department of Mathematics, Technion, Haifa 32000, Israel DANIEL KOTLAR Computer Science Department,
More informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationPreliminary Linear Algebra 1. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 100
Preliminary Linear Algebra 1 Copyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 100 Notation for all there exists such that therefore because end of proof (QED) Copyright c 2012
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationJ. A. Dias Da Silva* t
Sum Decompositions of Symmetric Matrices J. A. Dias Da Silva* t Departamento de Materruitica da Universidade de Lisboa Rua Ernesto de Vasconcelos, Bloco C 700 Lisboa, Portugal Daniel Hershkowitz* * Mathematics
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationCirculant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv: v1 [math.co] 26 Nov 2017
Circulant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv:1711.09373v1 [math.co] 26 Nov 2017 J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona October
More informationSTRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES
The Pennsylvania State University The Graduate School Department of Mathematics STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES A Dissertation in Mathematics by John T. Ethier c 008 John T. Ethier
More informationproposed. This method can easily be used to construct the trend free orthogonal arrays of higher level and higher strength.
International Journal of Scientific & Engineering Research, Volume 5, Issue 7, July-2014 1512 Trend Free Orthogonal rrays using some Linear Codes Poonam Singh 1, Veena Budhraja 2, Puja Thapliyal 3 * bstract
More informationSequential pairing of mixed integer inequalities
Sequential pairing of mixed integer inequalities Yongpei Guan, Shabbir Ahmed, George L. Nemhauser School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta,
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationAdditive Latin Transversals
Additive Latin Transversals Noga Alon Abstract We prove that for every odd prime p, every k p and every two subsets A = {a 1,..., a k } and B = {b 1,..., b k } of cardinality k each of Z p, there is a
More informationDIFFERENTIABILITY IN LOCAL FIELDS
DIFFERENTIABILITY IN LOCAL FIELDS OF PRIME CHARACTERISTIC CARL G. WAGNER 1. Introduction. In 1958 Mahler proved that every continuous p-adic function defined on the ring of p-adic integers is the uniform
More informationA FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*)
R912 Philips Res. Repts 30,337*-343*,1975 Issue in honour of C. J. Bouwkamp A FINITE BASIS THEOREM FOR PACKING BOXES WITH BRICKS*) by N. G. de BRUIJN Technological University Eindhoven Eindhoven, The Netherlands
More informationGabidulin Codes that are Generalized. Reed Solomon Codes
International Journal of Algebra, Vol. 4, 200, no. 3, 9-42 Gabidulin Codes that are Generalized Reed Solomon Codes R. F. Babindamana and C. T. Gueye Departement de Mathematiques et Informatique Faculte
More informationA REVERSIBLE CODE OVER GE(q)
KYBERNETIKA- VOLUME 22 (1986), NUMBER 1 A REVERSIBLE CODE OVER GE(q) SUNIL KUMAR MUTTOO*, SHANKAR LAL This paper deals with the construction of codes over GF(q), q prime, by annexing two triangular matrices,
More informationQUADRATIC RESIDUE CODES OVER Z 9
J. Korean Math. Soc. 46 (009), No. 1, pp. 13 30 QUADRATIC RESIDUE CODES OVER Z 9 Bijan Taeri Abstract. A subset of n tuples of elements of Z 9 is said to be a code over Z 9 if it is a Z 9 -module. In this
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationarxiv: v4 [cs.dm] 27 Oct 2016
On the Joint Entropy of d-wise-independent Variables Dmitry Gavinsky Pavel Pudlák January 0, 208 arxiv:503.0854v4 [cs.dm] 27 Oct 206 Abstract How low can the joint entropy of n d-wise independent for d
More informationError control codes for parallel asymmetric channels
Error control codes for parallel asymmetric channels R. Ahlswede and H. Aydinian Department of Mathematics University of Bielefeld POB 100131 D-33501 Bielefeld, Germany E-mail addresses: ahlswede@mathematik.uni-bielefeld.de
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationInteraction balance in symmetrical factorial designs with generalized minimum aberration
Interaction balance in symmetrical factorial designs with generalized minimum aberration Mingyao Ai and Shuyuan He LMAM, School of Mathematical Sciences, Peing University, Beijing 100871, P. R. China Abstract:
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More information05/03/ LECTURE Tuesday MATH Linear and Abstract Algebra
MATH 2022 Linear and Abstract Algebra 05/03/2019 04 LECTURE Tuesday Matrix arithmetic over a field F : # in first Year matrix entries typically come from IR or 1 " :i i t :: ii :: from any given field
More informationZero-sum square matrices
Zero-sum square matrices Paul Balister Yair Caro Cecil Rousseau Raphael Yuster Abstract Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
More informationA Proposed Quantum Low Density Parity Check Code
arxiv:quant-ph/83v 29 Aug 2 A Proposed Quantum Low Density Parity Check Code Michael S. Postol National Security Agency 98 Savage Road Fort Meade, MD 2755 Email: msposto@zombie.ncsc.mil June 3, 28 2 LOW
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA July 2004 The Autocorrelation Function The autocorrelation of a binary sequence {s(t)} of period N at shift w is C s (w) = ( 1) s(t+w) s(t). N 1 t=0 The
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationConstruction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs
Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs Noga Alon Jehoshua Bruck Joseph Naor Moni Naor Ron M. Roth Abstract A new technique, based on the pseudo-random
More informationDesigning Information Devices and Systems I Fall 2018 Lecture Notes Note 6
EECS 16A Designing Information Devices and Systems I Fall 2018 Lecture Notes Note 6 6.1 Introduction: Matrix Inversion In the last note, we considered a system of pumps and reservoirs where the water in
More information: Error Correcting Codes. October 2017 Lecture 1
03683072: Error Correcting Codes. October 2017 Lecture 1 First Definitions and Basic Codes Amnon Ta-Shma and Dean Doron 1 Error Correcting Codes Basics Definition 1. An (n, K, d) q code is a subset of
More informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
More informationMATHEMATICS AND GAMES* Nagayoshi lwahori University of Tokyo
MATHEMATICS AND GAMES* Nagayoshi lwahori University of Tokyo When one looks at mathematical phenomena or theories from various points of view instead of from only one angle, one usually gets some unexpected
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationGALOIS GROUPS AS PERMUTATION GROUPS
GALOIS GROUPS AS PERMUTATION GROUPS KEITH CONRAD 1. Introduction A Galois group is a group of field automorphisms under composition. By looking at the effect of a Galois group on field generators we can
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationIntroduction to Matrices
POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder
More informationOn permutation automorphism groups of q-ary Hamming codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 28, Pamporovo, Bulgaria pp. 119-124 On permutation automorphism groups of q-ary Hamming codes Evgeny V. Gorkunov
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationMATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
More informationMatrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...
Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
More informationNOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or
NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationPartial permutation decoding for binary linear Hadamard codes
Partial permutation decoding for binary linear Hadamard codes R. D. Barrolleta 1 and M. Villanueva 2 Departament d Enginyeria de la Informació i de les Comunicacions Universitat Autònoma de Barcelona Cerdanyola
More information15. T(x,y)=(x+4y,2a+3y) operator that maps a function into its second derivative. cos,zx are eigenvectors of D2, and find their corre
1. [ 2J X[1j P 21. r q [Suggestion: Work with the standard matrix for the operator.] vector of, and find the corresponding eigenvalue. eigenspace of the linear operator defined by the stated formula. In
More informationExercise 2.2. Find (with proof) all rational points on the curve y = 2 x.
Exercise 2.2. Find (with proof) all rational points on the curve y = 2 x. Exercise 2.4: Prove that for any integer n 0, e n is not a rational number. Exercise 2.5: Prove that the only rational point on
More informationWeak Uniform Distribution for Divisor Functions. I
mathematics of computation volume 50, number 181 january 1988, pages 335-342 Weak Uniform Distribution for Divisor Functions. I By Francis J. Rayner Abstract. Narkiewicz (reference [3, pp. 204-205]) has
More informationEECS 275 Matrix Computation
EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 17 1 / 26 Overview
More information6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities
6.207/14.15: Networks Lectures 4, 5 & 6: Linear Dynamics, Markov Chains, Centralities 1 Outline Outline Dynamical systems. Linear and Non-linear. Convergence. Linear algebra and Lyapunov functions. Markov
More informationReview Let A, B, and C be matrices of the same size, and let r and s be scalars. Then
1 Sec 21 Matrix Operations Review Let A, B, and C be matrices of the same size, and let r and s be scalars Then (i) A + B = B + A (iv) r(a + B) = ra + rb (ii) (A + B) + C = A + (B + C) (v) (r + s)a = ra
More information