<--- Back to Details
First PageDocument Content
Cryptography / Access control / Papermaking / Digital photography / Digital watermarking / Authentication / Money forgery / Watermark / Convolutional code / Cinavia
Date: 2018-06-20 05:23:08
Cryptography
Access control
Papermaking
Digital photography
Digital watermarking
Authentication
Money forgery
Watermark
Convolutional code
Cinavia

2018 10th International Conference on Cyber Conflict CyCon X: Maximising Effects T. Minárik, R. Jakschis, L. Lindström (Eds © NATO CCD COE Publications, Tallinn Permission to make digital or hard copies of thi

Add to Reading List

Source URL: www.lenders.ch

Download Document from Source Website

File Size: 2,72 MB

Share Document on Facebook

Similar Documents

Code available  Local Binary Convolutional Neural Networks Felix Juefei Xu 1, Vishnu Naresh Boddeti 2, Marios Savvides 1  IEEE 2017 Conference on

Code available Local Binary Convolutional Neural Networks Felix Juefei Xu 1, Vishnu Naresh Boddeti 2, Marios Savvides 1 IEEE 2017 Conference on

DocID: 1tCaD - View Document

UNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE ROXANA SMARANDACHE∗ Abstract. Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory code

UNIT MEMORY CONVOLUTIONAL CODES WITH MAXIMUM DISTANCE ROXANA SMARANDACHE∗ Abstract. Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory code

DocID: 1tgya - View Document

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULYring [D], with rank G(D) = k . For the purpose of this correspondence, we define the rate k=n convolutional code generated by G(D) as the set  Construct

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 5, JULYring [D], with rank G(D) = k . For the purpose of this correspondence, we define the rate k=n convolutional code generated by G(D) as the set Construct

DocID: 1tax6 - View Document

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam

DocID: 1rlYO - View Document

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