Cross-Error Correcting Integer Codes over Z 2
|
|
- Dylan Carr
- 5 years ago
- Views:
Transcription
1 Cross-Error Correcting Integer Codes over Z 2 m Anna-Lena Trautmann Department of Electrical & Computer Systems Eng., Monash University Department of Electrical & Electronic Engineering, University of Melbourne October 29th, 2014 ISITA 2014, Melbourne In collaboration with Emanuele Viterbo.
2 Introduction Motivation and Introduction Codes over integers are known objects, useful for e.g. coded modulation or magnetic recording. Discretized version of Euclidean metric is Lee metric. 1 / 21
3 Introduction Motivation and Introduction Codes over integers are known objects, useful for e.g. coded modulation or magnetic recording. Discretized version of Euclidean metric is Lee metric. Our special case: Errors only occur in one coordinate with an upper bound on the absolute error value. Then the decoding region (sphere) of a codeword is a cross. 1 / 21
4 Introduction Motivation and Introduction Codes over integers are known objects, useful for e.g. coded modulation or magnetic recording. Discretized version of Euclidean metric is Lee metric. Our special case: Errors only occur in one coordinate with an upper bound on the absolute error value. Then the decoding region (sphere) of a codeword is a cross Lee sphere Cross sphere 1 / 21
5 Introduction Further motivation: We can get larger code rates for cross spheres than for Lee spheres. Example Over Z 16 C L = {(0, 0), (1, 4), (4, 2), (5, 6)} is an optimal 2-Lee-error correcting code. But we can find a larger cross-error correcting code (with error magnitude 2) C + = {(1, 0), (4, 1), (6, 6), (0, 3), (3, 4)}. 2 / 21
6 Introduction Related Work Integer codes for errors in s coordinates with bounded error value (Vinck, Morita 98) Single cross error correcting integers codes over Z p (Morita, Kamada, Kostadinov, van Wijngaarden 07) Single peak shift correcting codes (Levenshtein-Vinck 93, Tamm 97) Works on Lee metric codes (e.g. Golomb-Welch 70, Etzion-Vardy-Yaakobi 10, Etzion 11) 3 / 21
7 Introduction Related Work Integer codes for errors in s coordinates with bounded error value (Vinck, Morita 98) Single cross error correcting integers codes over Z p (Morita, Kamada, Kostadinov, van Wijngaarden 07) Single peak shift correcting codes (Levenshtein-Vinck 93, Tamm 97) Works on Lee metric codes (e.g. Golomb-Welch 70, Etzion-Vardy-Yaakobi 10, Etzion 11) Open question: General results on and constructions of cross error correcting codes over Z 2 m. 3 / 21
8 Mathematical Framework and Bounds 1 Introduction 2 Mathematical Framework and Bounds 3 Linear Constructions for n = 2, 3 4 Decoding 5 Conclusion
9 Mathematical Framework and Bounds Definition (Cross Distance) For any v, w Z n q v i w i if v i w i and v j = w j j i d + (v, w) := 0 if v = w. if i, j : i j, v i w i, v j w j 4 / 21
10 Mathematical Framework and Bounds Definition (Cross Distance) For any v, w Z n q v i w i if v i w i and v j = w j j i d + (v, w) := 0 if v = w. if i, j : i j, v i w i, v j w j Theorem The cross distance sphere with center c and radius t, S + t (c) := {v Zn q d + (v, c) t} is exactly the set of c plus all possible cross errors of magnitude at most t, i.e. S + t (c) = {c + αe i α t}. 4 / 21
11 Mathematical Framework and Bounds Definition (Cross Distance) For any v, w Z n q v i w i if v i w i and v j = w j j i d + (v, w) := 0 if v = w. if i, j : i j, v i w i, v j w j Theorem The cross distance sphere with center c and radius t, S + t (c) := {v Zn q d + (v, c) t} is exactly the set of c plus all possible cross errors of magnitude at most t, i.e. S + t (c) = {c + αe i α t}. = An integer code C is cross-error correcting with error magnitude t iff d + (C) 2t / 21
12 Mathematical Framework and Bounds Lemma A cross sphere in Z n q with radius t and any center c Z n q has volume (c) = 2nt + 1. S + t 5 / 21
13 Mathematical Framework and Bounds Lemma A cross sphere in Z n q with radius t and any center c Z n q has volume (c) = 2nt + 1. Theorem S + t Sphere Packing Bound for C + Z n 2m for error magnitude t: C + Zn 2 m 2nm S t + = (0) 2nt / 21
14 Mathematical Framework and Bounds Lemma A cross sphere in Z n q with radius t and any center c Z n q has volume (c) = 2nt + 1. Theorem S + t Sphere Packing Bound for C + Z n 2m for error magnitude t: C + Zn 2 m 2nm S t + = (0) 2nt + 1. A linear code in Z n 2 m has cardinality 2l, l N. Thus, sphere packing bound for linear codes is the greatest power of 2 below or equal to the above bound. 5 / 21
15 Mathematical Framework and Bounds 2 m C L C + Clin L C + lin Table : Sphere packing bounds on the cardinality of the different codes in Z 2 2m for t = 3. 2 m C L C + Clin L C + lin Table : Sphere packing bounds on the cardinality of the different codes in Z 3 2m for t = 2. 6 / 21
16 Linear Constructions for n = 2, 3 1 Introduction 2 Mathematical Framework and Bounds 3 Linear Constructions for n = 2, 3 4 Decoding 5 Conclusion
17 Linear Constructions for n = 2, 3 Theorem Let k := max{i N 2 i t} and m k + 2. The following is a parity check matrix of a cross code in Z 2 2 m with error magnitude t: ( 2 m k 2 2 H = m k 2 ) 0 2 m k 1. The cardinality of this code is C = 2 2(m k) 3. 7 / 21
18 Linear Constructions for n = 2, 3 Examples: Error magnitude t = 3, over Z 16 : ( ) 2 2 H = 0 4 defines a code of cardinality 8 with generator matrix ( ) 4 4 G =. 0 8 Error magnitude t = 7, over Z 16 : ( ) 1 1 H = 0 2 defines a code of cardinality 2 with generator matrix G = ( 8 8 ). 8 / 21
19 Linear Constructions for n = 2, 3 Error magnitude t = 3, over Z 16 : / 21
20 Linear Constructions for n = 2, 3 Error magnitude t = 3, over Z 64 : / 21
21 Linear Constructions for n = 2, 3 Theorem Let m 4 and t = 2 or t = 3. The code in Z 2 2 m or parity check matrix G = ( 1 t ) generated by H = ( (t + 1) 2 m 4 2 m 4) is a cross code with magnitude t and cardinality 2 2(m t) if m 6. If m = 4 the cardinality is 16 for both t = 2, 3 and if m = 5 the cardinality is 32 for t = 3 and 64 for t = 2. (Typo in paper for m = 5.) 11 / 21
22 Linear Constructions for n = 2, 3 Error magnitude t = 2, over Z 32 : / 21
23 Linear Constructions for n = 2, 3 Error magnitude t = 3, over Z 32 : / 21
24 Linear Constructions for n = 2, 3 Theorem Let k N be maximal such that 2 k t. A parity check matrix of the form ( 2 m k 2 2 H = m k 2 2 m k 2 ) 0 2 m k 1 (2t + 1) 2 m k 2, defines a cross error correcting code in Z 3 2m of magnitude t. 14 / 21
25 Linear Constructions for n = 2, 3 Examples: Error magnitude t = 3, over Z 16 : ( ) H = defines a code of cardinality 64 with generator matrix ( ) G = Error magnitude t = 7, over Z 16 : ( ) H = defines a code of cardinality 16 with generator matrix ( ) G = / 21
26 Decoding 1 Introduction 2 Mathematical Framework and Bounds 3 Linear Constructions for n = 2, 3 4 Decoding 5 Conclusion
27 Decoding Lemma Assume that the error vector e Z n 2 m has only one non-zero coordinate i (i.e. Hamming weight 1) whose value α is in ±{1,..., t}. Then the syndrome vector s = rh T = (c + e)h T = eh T is the α-multiple of (the transpose of) the i-th column of H. 16 / 21
28 Decoding Lemma Assume that the error vector e Z n 2 m has only one non-zero coordinate i (i.e. Hamming weight 1) whose value α is in ±{1,..., t}. Then the syndrome vector s = rh T = (c + e)h T = eh T is the α-multiple of (the transpose of) the i-th column of H. = If we can easily identify the multiples of the columns of H, we can easily syndrome decode our codes. 16 / 21
29 Decoding Decoding algorithm for code with parity check matrix ( 2 m k 2 2 H = m k 2 ) 0 2 m k 1 : Compute the syndromes (s 1 s 2 ) = rh T. IF s 2 = 0 and 2 m k 2 s 1 THEN e := (s 1 /2 m k 2 0). ELSEIF 2s 1 = s 2 and 2 m k 2 s 1 THEN e := (0 s 1 /2 m k 2 ). ELSE return failure. Return c = r e. 17 / 21
30 Decoding Decoding algorithm for code with parity check matrix ( 2 m k 2 2 H = m k 2 ) 0 2 m k 1 : Compute the syndromes (s 1 s 2 ) = rh T. IF s 2 = 0 and 2 m k 2 s 1 THEN e := (s 1 /2 m k 2 0). ELSEIF 2s 1 = s 2 and 2 m k 2 s 1 THEN e := (0 s 1 /2 m k 2 ). ELSE return failure. Return c = r e. 17 / 21
31 Decoding Decoding algorithm for code with parity check matrix ( 2 m k 2 2 H = m k 2 ) 0 2 m k 1 : Compute the syndromes (s 1 s 2 ) = rh T. IF s 2 = 0 and 2 m k 2 s 1 THEN e := (s 1 /2 m k 2 0). ELSEIF 2s 1 = s 2 and 2 m k 2 s 1 THEN e := (0 s 1 /2 m k 2 ). ELSE return failure. Return c = r e. 17 / 21
32 Decoding Decoding algorithm for code with parity check matrix ( 2 m k 2 2 H = m k 2 ) 0 2 m k 1 : Compute the syndromes (s 1 s 2 ) = rh T. IF s 2 = 0 and 2 m k 2 s 1 THEN e := (s 1 /2 m k 2 0). ELSEIF 2s 1 = s 2 and 2 m k 2 s 1 THEN e := (0 s 1 /2 m k 2 ). ELSE return failure. Return c = r e. 17 / 21
33 Decoding Example: Consider the code over Z 16 with t = 3 and ( ) 2 2 H = 0 4 and a received word r = (12 6). Then (s 1 s 2 ) = rh T = (4 8), i.e. 2s 1 = s 2 which means that the error is of the form e = (0 s 1 /2) = (0 2). Hence, we decode to the codeword c = r e = (12 4). 18 / 21
34 Conclusion 1 Introduction 2 Mathematical Framework and Bounds 3 Linear Constructions for n = 2, 3 4 Decoding 5 Conclusion
35 Conclusion Conclusion: We presented constructions for linear cross error correcting codes in Z n 2m for general m and t, for n = 2, 3. These constructions are asymptotically optimal, i.e. achieve the sphere packing bound for m. We presented a decoding algorithm for one of these constructions. Similar algorithms exist for the other constructions. 19 / 21
36 Conclusion Conclusion: We presented constructions for linear cross error correcting codes in Z n 2m for general m and t, for n = 2, 3. These constructions are asymptotically optimal, i.e. achieve the sphere packing bound for m. We presented a decoding algorithm for one of these constructions. Similar algorithms exist for the other constructions. Open question 1: Are some of these codes optimal? Open question 2: For which parameters can we get better cross codes than optimal Lee codes? Open question 3: Constructions for larger n? 19 / 21
37 Conclusion Open question 4: Unions of (shifts of) linear codes?! / 21
38 Conclusion Almost optimal (by factor 2) linear code with t = 2: / 21
39 Thank you for your attention!
ELEC 405/ELEC 511 Error Control Coding. Hamming Codes and Bounds on Codes
ELEC 405/ELEC 511 Error Control Coding Hamming Codes and Bounds on Codes Single Error Correcting Codes (3,1,3) code (5,2,3) code (6,3,3) code G = rate R=1/3 n-k=2 [ 1 1 1] rate R=2/5 n-k=3 1 0 1 1 0 G
More informationELEC 405/ELEC 511 Error Control Coding and Sequences. Hamming Codes and the Hamming Bound
ELEC 45/ELEC 5 Error Control Coding and Sequences Hamming Codes and the Hamming Bound Single Error Correcting Codes ELEC 45 2 Hamming Codes One form of the (7,4,3) Hamming code is generated by This is
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationOn Syndrome Decoding of Chinese Remainder Codes
On Syndrome Decoding of Chinese Remainder Codes Wenhui Li Institute of, June 16, 2012 Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012) Pomorie, Bulgaria Wenhui
More informationELEC 519A Selected Topics in Digital Communications: Information Theory. Hamming Codes and Bounds on Codes
ELEC 519A Selected Topics in Digital Communications: Information Theory Hamming Codes and Bounds on Codes Single Error Correcting Codes 2 Hamming Codes (7,4,3) Hamming code 1 0 0 0 0 1 1 0 1 0 0 1 0 1
More informationInteger Codes in Coding and Computing
1 1 Integer Codes in Coding and Computing Ulrich Tamm Abstract A single checksum for codes consisting of n integer components is investigated. In coding theory this is mostly used for single error correction
More informationHamming Codes 11/17/04
Hamming Codes 11/17/04 History In the late 1940 s Richard Hamming recognized that the further evolution of computers required greater reliability, in particular the ability to not only detect errors, but
More informationOn Linear Subspace Codes Closed under Intersection
On Linear Subspace Codes Closed under Intersection Pranab Basu Navin Kashyap Abstract Subspace codes are subsets of the projective space P q(n), which is the set of all subspaces of the vector space F
More informationAn Introduction to (Network) Coding Theory
An Introduction to (Network) Coding Theory Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland July 12th, 2018 1 Coding Theory Introduction Reed-Solomon codes 2 Introduction Coherent network
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationNetwork Coding and Schubert Varieties over Finite Fields
Network Coding and Schubert Varieties over Finite Fields Anna-Lena Horlemann-Trautmann Algorithmics Laboratory, EPFL, Schweiz October 12th, 2016 University of Kentucky What is this talk about? 1 / 31 Overview
More informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More information2012 IEEE International Symposium on Information Theory Proceedings
Decoding of Cyclic Codes over Symbol-Pair Read Channels Eitan Yaakobi, Jehoshua Bruck, and Paul H Siegel Electrical Engineering Department, California Institute of Technology, Pasadena, CA 9115, USA Electrical
More informationAnswers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics
Answers and Solutions to (Even Numbered) Suggested Exercises in Sections 6.5-6.9 of Grimaldi s Discrete and Combinatorial Mathematics Section 6.5 6.5.2. a. r = = + = c + e. So the error pattern is e =.
More informationexercise in the previous class (1)
exercise in the previous class () Consider an odd parity check code C whose codewords are (x,, x k, p) with p = x + +x k +. Is C a linear code? No. x =, x 2 =x =...=x k = p =, and... is a codeword x 2
More informationFlip-N-Write: A Simple Deterministic Technique to Improve PRAM Write Performance, Energy and Endurance. Presenter: Brian Wongchaowart March 17, 2010
Flip-N-Write: A Simple Deterministic Technique to Improve PRAM Write Performance, Energy and Endurance Sangyeun Cho Hyunjin Lee Presenter: Brian Wongchaowart March 17, 2010 Motivation Suppose that you
More informationThe extended coset leader weight enumerator
The extended coset leader weight enumerator Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands Symposium on Information Theory in the Benelux, 2009 1/14 Outline Codes, weights
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 informationAn Improvement of Non-binary Code Correcting Single b-burst of Insertions or Deletions
An Improvement of Non-binary Code Correcting Single b-burst of Insertions or Deletions Toyohiko Saeki, Takayuki Nozaki Yamaguchi University ISITA2018 Oct. 29th, 2018 1 / 15 Background (1: Purpose) b-burst
More informationAn Introduction to (Network) Coding Theory
An to (Network) Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland April 24th, 2018 Outline 1 Reed-Solomon Codes 2 Network Gabidulin Codes 3 Summary and Outlook A little bit of history
More informationCorrecting Localized Deletions Using Guess & Check Codes
55th Annual Allerton Conference on Communication, Control, and Computing Correcting Localized Deletions Using Guess & Check Codes Salim El Rouayheb Rutgers University Joint work with Serge Kas Hanna and
More informationHamming codes and simplex codes ( )
Chapter 6 Hamming codes and simplex codes (2018-03-17) Synopsis. Hamming codes are essentially the first non-trivial family of codes that we shall meet. We start by proving the Distance Theorem for linear
More informationSolutions to problems from Chapter 3
Solutions to problems from Chapter 3 Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga February 28, 2016 For a systematic (7,4) linear block code, the parity
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationError control of line codes generated by finite Coxeter groups
Error control of line codes generated by finite Coxeter groups Ezio Biglieri Universitat Pompeu Fabra, Barcelona, Spain Email: e.biglieri@ieee.org Emanuele Viterbo Monash University, Melbourne, Australia
More informationSkew cyclic codes: Hamming distance and decoding algorithms 1
Skew cyclic codes: Hamming distance and decoding algorithms 1 J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro Department of Algebra and CITIC, University of Granada Department of Computer Sciences and
More informationWrite Once Memory Codes and Lattices for Flash Memories
Write Once Memory Codes and Lattices for Flash Memories Japan Advanced Institute of Science and Technology September 19, 2012 Seoul National University Japan Advanced Institute of Science and Technology
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationTilings of Binary Spaces
Tilings of Binary Spaces Gérard Cohen Département Informatique ENST, 46 rue Barrault 75634 Paris, France Simon Litsyn Department of Electrical Engineering Tel-Aviv University Ramat-Aviv 69978, Israel Alexander
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationImproved Upper Bounds on Sizes of Codes
880 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 4, APRIL 2002 Improved Upper Bounds on Sizes of Codes Beniamin Mounits, Tuvi Etzion, Senior Member, IEEE, and Simon Litsyn, Senior Member, IEEE
More informationConstruction of Barnes-Wall Lattices from Linear Codes over Rings
01 IEEE International Symposium on Information Theory Proceedings Construction of Barnes-Wall Lattices from Linear Codes over Rings J Harshan Dept of ECSE, Monh University Clayton, Australia Email:harshanjagadeesh@monhedu
More informationIndex Coding With Erroneous Side Information
Index Coding With Erroneous Side Information Jae-Won Kim and Jong-Seon No, Fellow, IEEE 1 Abstract arxiv:1703.09361v1 [cs.it] 28 Mar 2017 In this paper, new index coding problems are studied, where each
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationA Singleton Bound for Lattice Schemes
1 A Singleton Bound for Lattice Schemes Srikanth B. Pai, B. Sundar Rajan, Fellow, IEEE Abstract arxiv:1301.6456v4 [cs.it] 16 Jun 2015 In this paper, we derive a Singleton bound for lattice schemes and
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
More informationDecoding of the Five-Error-Correcting Binary Quadratic Residue Codes
American Journal of Mathematical and Computer Modelling 2017; 2(1): 6-12 http://www.sciencepublishinggroup.com//amcm doi: 10.1168/.amcm.20170201.12 Decoding of the Five-Error-Correcting Binary Quadratic
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 informationCan You Hear Me Now?
Can You Hear Me Now? An Introduction to Coding Theory William J. Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 19 October 2004 W. J. Turner (Wabash College)
More informationSolutions or answers to Final exam in Error Control Coding, October 24, G eqv = ( 1+D, 1+D + D 2)
Solutions or answers to Final exam in Error Control Coding, October, Solution to Problem a) G(D) = ( +D, +D + D ) b) The rate R =/ and ν i = ν = m =. c) Yes, since gcd ( +D, +D + D ) =+D + D D j. d) An
More informationCodes over Subfields. Chapter Basics
Chapter 7 Codes over Subfields In Chapter 6 we looked at various general methods for constructing new codes from old codes. Here we concentrate on two more specialized techniques that result from writing
More informationCoding Theory. Ruud Pellikaan MasterMath 2MMC30. Lecture 11.1 May
Coding Theory Ruud Pellikaan g.r.pellikaan@tue.nl MasterMath 2MMC30 /k Lecture 11.1 May 12-2016 Content lecture 11 2/31 In Lecture 8.2 we introduced the Key equation Now we introduce two algorithms which
More informationTackling Intracell Variability in TLC Flash Through Tensor Product Codes
Tackling Intracell Variability in TLC Flash Through Tensor Product Codes Ryan Gabrys, Eitan Yaakobi, Laura Grupp, Steven Swanson, Lara Dolecek University of California, Los Angeles University of California,
More informationChapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationLeech Constellations of Construction-A Lattices
Leech Constellations of Construction-A Lattices Joseph J. Boutros Talk at Nokia Bell Labs, Stuttgart Texas A&M University at Qatar In collaboration with Nicola di Pietro. March 7, 2017 Thanks Many Thanks
More informationCodes for Partially Stuck-at Memory Cells
1 Codes for Partially Stuck-at Memory Cells Antonia Wachter-Zeh and Eitan Yaakobi Department of Computer Science Technion Israel Institute of Technology, Haifa, Israel Email: {antonia, yaakobi@cs.technion.ac.il
More informationIntroduction to binary block codes
58 Chapter 6 Introduction to binary block codes In this chapter we begin to study binary signal constellations, which are the Euclidean-space images of binary block codes. Such constellations have nominal
More informationLow-Power Cooling Codes with Efficient Encoding and Decoding
Low-Power Cooling Codes with Efficient Encoding and Decoding Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei School of Physical and Mathematical Sciences, Nanyang Technological
More informationLecture 17: Perfect Codes and Gilbert-Varshamov Bound
Lecture 17: Perfect Codes and Gilbert-Varshamov Bound Maximality of Hamming code Lemma Let C be a code with distance 3, then: C 2n n + 1 Codes that meet this bound: Perfect codes Hamming code is a perfect
More informationDistinct Difference Configurations
Distinct Difference Configurations Simon R. Blackburn Joint work with: Tuvi Etzion, Keith M. Martin, Maura B. Paterson Royal Holloway, University of London 16th July 009 S.R. Blackburn (RHUL) Distinct
More informationEfficient Decoding of Permutation Codes Obtained from Distance Preserving Maps
2012 IEEE International Symposium on Information Theory Proceedings Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps Yeow Meng Chee and Punarbasu Purkayastha Division of Mathematical
More informationLecture B04 : Linear codes and singleton bound
IITM-CS6845: Theory Toolkit February 1, 2012 Lecture B04 : Linear codes and singleton bound Lecturer: Jayalal Sarma Scribe: T Devanathan We start by proving a generalization of Hamming Bound, which we
More informationThe 123 Theorem and its extensions
The 123 Theorem and its extensions Noga Alon and Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract It is shown
More informationData Representation for Flash Memories 53
Data Representation for Flash Memories 53 Data Representation for Flash Memories 04 Anxiao (Andrew) Jiang Computer Science and Engineering Dept. Texas A&M University College Station, TX 77843, U.S.A. ajiang@cse.tamu.edu
More informationAlternant and BCH codes over certain rings
Computational and Applied Mathematics Vol. 22, N. 2, pp. 233 247, 2003 Copyright 2003 SBMAC Alternant and BCH codes over certain rings A.A. ANDRADE 1, J.C. INTERLANDO 1 and R. PALAZZO JR. 2 1 Department
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 informationEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Linear Block Codes February 14, 2007 1. Code 1: n = 4, n k = 2 Parity Check Equations: x 1 + x 3 = 0, x 1 + x 2 + x 4 = 0 Parity Bits: x 3 = x 1,
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationSection 3 Error Correcting Codes (ECC): Fundamentals
Section 3 Error Correcting Codes (ECC): Fundamentals Communication systems and channel models Definition and examples of ECCs Distance For the contents relevant to distance, Lin & Xing s book, Chapter
More informationMATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016
MATH/MTHE 406 Homework Assignment 2 due date: October 17, 2016 Notation: We will use the notations x 1 x 2 x n and also (x 1, x 2,, x n ) to denote a vector x F n where F is a finite field. 1. [20=6+5+9]
More informationMathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
More informationTwo-Dimensional Patterns with Distinct Differences Constructions, Bounds, and Maximal Anticodes
1 Two-Dimensional Patterns with Distinct Differences Constructions, Bounds, and Maximal Anticodes Simon R. Blackburn, Tuvi Etzion, Keith M. Martin and Maura B. Paterson Abstract A two-dimensional grid
More informationOn Locating-Dominating Codes in Binary Hamming Spaces
Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and
More informationAsymptotic bounds for the sizes of constant dimension codes and an improved lower bound
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound 5th ICMCTA Vihula Manor, 28-31 August 2017 Daniel Heinlein University of Bayreuth, Germany Daniel.Heinlein@uni-bayreuth.de
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationList Decoding of Lee Metric Codes. Ido Tal
List Decoding of Lee Metric Codes Ido Tal List Decoding of Lee Metric Codes Research Thesis Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science
More informationCoding Techniques for Data Storage Systems
Coding Techniques for Data Storage Systems Thomas Mittelholzer IBM Zurich Research Laboratory /8 Göttingen Agenda. Channel Coding and Practical Coding Constraints. Linear Codes 3. Weight Enumerators and
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationHypercube Coloring and the Structure of Binary Codes
Hypercube Coloring and the Structure of Binary Codes by James Gregory Rix A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in The College of Graduate Studies
More information1. How many errors may be detected (not necessarily corrected) if a code has a Hamming Distance of 6?
Answers to Practice Problems Practice Problems - Hamming distance 1. How many errors may be detected (not necessarily corrected) if a code has a Hamming Distance of 6? 2n = 6; n=3 2. How many errors may
More informationCodes and Designs in the Grassmann Scheme
Codes and Designs in the Grassmann Scheme Tuvi Etzion Computer Science Department Technion -Israel Institute of Technology etzion@cs.technion.ac.il ALGEBRAIC COMBINATORICS AND APPLICATIONS ALCOMA10, Thurnau,
More informationCode design: Computer search
Code design: Computer search Low rate codes Represent the code by its generator matrix Find one representative for each equivalence class of codes Permutation equivalences? Do NOT try several generator
More informationThe Golay codes. Mario de Boer and Ruud Pellikaan
The Golay codes Mario de Boer and Ruud Pellikaan Appeared in Some tapas of computer algebra (A.M. Cohen, H. Cuypers and H. Sterk eds.), Project 7, The Golay codes, pp. 338-347, Springer, Berlin 1999, after
More informationREED-SOLOMON CODE SYMBOL AVOIDANCE
Vol105(1) March 2014 SOUTH AFRICAN INSTITUTE OF ELECTRICAL ENGINEERS 13 REED-SOLOMON CODE SYMBOL AVOIDANCE T Shongwe and A J Han Vinck Department of Electrical and Electronic Engineering Science, University
More informationBMO Round 2 Problem 3 Generalisation and Bounds
BMO 2007 2008 Round 2 Problem 3 Generalisation and Bounds Joseph Myers February 2008 1 Introduction Problem 3 (by Paul Jefferys) is: 3. Adrian has drawn a circle in the xy-plane whose radius is a positive
More informationLecture 2 Linear Codes
Lecture 2 Linear Codes 2.1. Linear Codes From now on we want to identify the alphabet Σ with a finite field F q. For general codes, introduced in the last section, the description is hard. For a code of
More informationLecture 12: November 6, 2017
Information and Coding Theory Autumn 017 Lecturer: Madhur Tulsiani Lecture 1: November 6, 017 Recall: We were looking at codes of the form C : F k p F n p, where p is prime, k is the message length, and
More informationMessage Encoding and Retrieval for Spread and Cyclic Orbit Codes
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes Anna-Lena Trautmann, Member, IEEE Department of Electrical and Electronic Engineering University of Melbourne, Australia Department of Electrical
More informationLecture 4: Codes based on Concatenation
Lecture 4: Codes based on Concatenation Error-Correcting Codes (Spring 206) Rutgers University Swastik Kopparty Scribe: Aditya Potukuchi and Meng-Tsung Tsai Overview In the last lecture, we studied codes
More informationLinear Codes and Syndrome Decoding
Linear Codes and Syndrome Decoding These notes are intended to be used as supplementary reading to Sections 6.7 9 of Grimaldi s Discrete and Combinatorial Mathematics. The proofs of the theorems are left
More information11 Minimal Distance and the Parity Check Matrix
MATH32031: Coding Theory Part 12: Hamming Codes 11 Minimal Distance and the Parity Check Matrix Theorem 23 (Distance Theorem for Linear Codes) Let C be an [n, k] F q -code with parity check matrix H. Then
More informationWeek 3: January 22-26, 2018
EE564/CSE554: Error Correcting Codes Spring 2018 Lecturer: Viveck R. Cadambe Week 3: January 22-26, 2018 Scribe: Yu-Tse Lin Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationLattice Coding I: From Theory To Application
Dept of Electrical and Computer Systems Engineering Monash University amin.sakzad@monash.edu Oct. 2013 1 Motivation 2 Preliminaries s Three examples 3 Problems Sphere Packing Problem Covering Problem Quantization
More informationIN THE last several years, there has been considerable
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 8, AUGUST 2002 2291 Unitary Signal Constellations Differential Space Time Modulation With Two Transmit Antennas: Parametric Codes, Optimal Designs,
More informationThe extended Golay code
The extended Golay code N. E. Straathof July 6, 2014 Master thesis Mathematics Supervisor: Dr R. R. J. Bocklandt Korteweg-de Vries Instituut voor Wiskunde Faculteit der Natuurwetenschappen, Wiskunde en
More informationAn Alternative Decoding Method for Gabidulin Codes in Characteristic Zero
An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert Institute of Communications Engineering, Ulm University, Germany IEEE
More informationCoding Schemes for Crisscross Error Patterns
Wireless Pers Commun DOI.7/s277-7-9389-6 Coding Schemes for Crisscross Error Patterns Simon Plass Gerd Richter A. J. Han Vinck Springer Science+Business Media, LLC. 27 Abstract This paper addresses two
More informationPCP Theorem and Hardness of Approximation
PCP Theorem and Hardness of Approximation An Introduction Lee Carraher and Ryan McGovern Department of Computer Science University of Cincinnati October 27, 2003 Introduction Assuming NP P, there are many
More information4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER /$ IEEE
4488 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER 2008 List Decoding of Biorthogonal Codes the Hadamard Transform With Linear Complexity Ilya Dumer, Fellow, IEEE, Grigory Kabatiansky,
More informationAlgebraic Soft-Decision Decoding of Reed Solomon Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 11, NOVEMBER 2003 2809 Algebraic Soft-Decision Decoding of Reed Solomon Codes Ralf Koetter, Member, IEEE, Alexer Vardy, Fellow, IEEE Abstract A polynomial-time
More informationIntroduction to Convolutional Codes, Part 1
Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes
More information4F5: Advanced Communications and Coding
4F5: Advanced Communications and Coding Coding Handout 4: Reed Solomon Codes Jossy Sayir Signal Processing and Communications Lab Department of Engineering University of Cambridge jossy.sayir@eng.cam.ac.uk
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More information