IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i13p1577-d588426.html
   My bibliography  Save this article

An Embedding Strategy Using Q-Ary Convolutional Codes for Large and Small Payloads

Author

Listed:
  • Jyun-Jie Wang

    (Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung 411030, Taiwan)

  • Chi-Yuan Lin

    (Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung 411030, Taiwan)

  • Sheng-Chih Yang

    (Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung 411030, Taiwan)

  • Hsi-Yuan Chang

    (Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan 701, Taiwan)

  • Yin-Chen Lin

    (Ph. D. Program, Prospective Technology of Electrical Engineering and Computer Science, National Chin-Yi University of Technology, Taichung 411030, Taiwan)

Abstract

Matrix embedding (ME) code is a commonly used steganography technique, which uses linear block codes to improve embedding efficiency. However, its main disadvantage is the inability to perform maximum likelihood decoding due to the high complexity of decoding large ME codes. As such, it is difficult to improve the embedding efficiency. The proposed q-ary embedding code can provide excellent embedding efficiency and is suitable for various embedding rates (large and small payloads). This article discusses that by using perforation technology, a convolutional code with a high embedding rate can be easily converted into a convolutional code with a low embedding rate. By keeping the embedding rate of the (2, 1) convolutional code unchanged, convolutional codes with different embedding rates can be designed through puncturing.

Suggested Citation

  • Jyun-Jie Wang & Chi-Yuan Lin & Sheng-Chih Yang & Hsi-Yuan Chang & Yin-Chen Lin, 2021. "An Embedding Strategy Using Q-Ary Convolutional Codes for Large and Small Payloads," Mathematics, MDPI, vol. 9(13), pages 1-12, July.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:13:p:1577-:d:588426
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/13/1577/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/13/1577/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:13:p:1577-:d:588426. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.