How to generate cyclically permutable codes from cyclic codes

Minoru Kuribayashi, Hatsukazu Tanaka

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace. However, no approach for the efficient construction of cyclically permutable code from binary cyclic codes has been proposed thus far. In this study, we propose an approach for the efficient and systematic construction of a cyclically permutable code from a cyclic code by utilizing an algebraic property. The proposed coding method improves the robustness of watermarking, particularly for video frames, against a clipping attack.

Original languageEnglish
Pages (from-to)4660-4663
Number of pages4
JournalIEEE Transactions on Information Theory
Volume52
Issue number10
DOIs
Publication statusPublished - Oct 2006
Externally publishedYes

Fingerprint

Watermarking
coding
video

Keywords

  • Clipping attack
  • Cyclic shift invariant
  • Cyclically permutable code
  • Watermark

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

How to generate cyclically permutable codes from cyclic codes. / Kuribayashi, Minoru; Tanaka, Hatsukazu.

In: IEEE Transactions on Information Theory, Vol. 52, No. 10, 10.2006, p. 4660-4663.

Research output: Contribution to journalArticle

@article{2f8148445a8a44ba9fec24c85b7eafd1,
title = "How to generate cyclically permutable codes from cyclic codes",
abstract = "On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace. However, no approach for the efficient construction of cyclically permutable code from binary cyclic codes has been proposed thus far. In this study, we propose an approach for the efficient and systematic construction of a cyclically permutable code from a cyclic code by utilizing an algebraic property. The proposed coding method improves the robustness of watermarking, particularly for video frames, against a clipping attack.",
keywords = "Clipping attack, Cyclic shift invariant, Cyclically permutable code, Watermark",
author = "Minoru Kuribayashi and Hatsukazu Tanaka",
year = "2006",
month = "10",
doi = "10.1109/TIT.2006.881834",
language = "English",
volume = "52",
pages = "4660--4663",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - How to generate cyclically permutable codes from cyclic codes

AU - Kuribayashi, Minoru

AU - Tanaka, Hatsukazu

PY - 2006/10

Y1 - 2006/10

N2 - On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace. However, no approach for the efficient construction of cyclically permutable code from binary cyclic codes has been proposed thus far. In this study, we propose an approach for the efficient and systematic construction of a cyclically permutable code from a cyclic code by utilizing an algebraic property. The proposed coding method improves the robustness of watermarking, particularly for video frames, against a clipping attack.

AB - On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace. However, no approach for the efficient construction of cyclically permutable code from binary cyclic codes has been proposed thus far. In this study, we propose an approach for the efficient and systematic construction of a cyclically permutable code from a cyclic code by utilizing an algebraic property. The proposed coding method improves the robustness of watermarking, particularly for video frames, against a clipping attack.

KW - Clipping attack

KW - Cyclic shift invariant

KW - Cyclically permutable code

KW - Watermark

UR - http://www.scopus.com/inward/record.url?scp=33947415235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947415235&partnerID=8YFLogxK

U2 - 10.1109/TIT.2006.881834

DO - 10.1109/TIT.2006.881834

M3 - Article

VL - 52

SP - 4660

EP - 4663

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

ER -