<--- Back to Details
First PageDocument Content
Coding theory / Mathematics / MDS matrix / Discrete mathematics / Singleton bound / MDS / ReedSolomon error correction / Erasure code
Date: 2018-02-09 07:39:38
Coding theory
Mathematics
MDS matrix
Discrete mathematics
Singleton bound
MDS
ReedSolomon error correction
Erasure code

Mixing Layers in Symmetric Crypto Ko Stoffelen Joint work withThorsten Kranz, Gregor Leander, Ko Stoffelen, Friedrich Wiemer. Shorter

Add to Reading List

Source URL: ko.stoffelen.nl

Download Document from Source Website

File Size: 841,91 KB

Share Document on Facebook

Similar Documents

INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

INTERSECTED LOW-DENSITY PARITY-CHECK AND CONVOLUTIONAL CODES Edward A. Ratzer Cavendish Laboratory, University of Cambridge, Cambridge Key words to describe this work: Low-density parity-check (LDPC) codes, convolutional

DocID: 1riYP - View Document

6536  IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random Codes

6536 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 61, NO. 12, DECEMBER 2015 Optimal Achievable Rates for Interference Networks With Random Codes

DocID: 1pWdo - View Document

Intersected low-density parity-check and convolutional codes Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE  Abstract

Intersected low-density parity-check and convolutional codes Edward A. Ratzer Cavendish Laboratory, University of Cambridge Madingley Road, Cambridge CB3 0HE Abstract

DocID: 1pr57 - View Document

Spectral Graph Theory  Lecture 11 Introduction to Coding Theory Daniel A. Spielman

Spectral Graph Theory Lecture 11 Introduction to Coding Theory Daniel A. Spielman

DocID: 1p98C - View Document

Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes,

Computing the minimal distance of cyclic codes Jos´ e Felipe Voloch Abstract: We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes. Keywords: cyclic codes,

DocID: 1p3uS - View Document