56,369 Hits in 5.5 sec

Generic Decoding in the Cover Metric [article]

Sebastian Bitzer, Julian Renner, Antonia Wachter-Zeh, Violetta Weger
2022 arXiv   pre-print
We then provide a generic decoder, following the information set decoding idea from Prange's algorithm in the Hamming metric.  ...  In this paper, we study the hardness of decoding a random code endowed with the cover metric.  ...  The first author acknowledges the financial support by the Federal Ministry of Education and Research of Germany in the programme of "Souverän. Digital. Vernetzt.".  ... 
arXiv:2205.12738v1 fatcat:siid6xcu7rd6tdjkbudz3fzjuy

List-decodable Codes and Covering Codes [article]

Hao Chen
2022 arXiv   pre-print
We prove new general simple but strong upper bounds for list-decodable codes in general finite metric spaces based on various covering codes.  ...  Our results give exponential improvements on the recent generalized Singleton upper bound in STOC 2020 for Hamming metric list-decodable codes, when the code lengths are large.  ...  Covering code upper bounds The main result of this paper is the following covering code upper bound for the list-decodable codes in general finite metric spaces.  ... 
arXiv:2109.02818v13 fatcat:7zmmcst44nbfjixv7u2dhyppii

Performance analysis on secured data method in natural language steganography

Roshidi Din, Rosmadi Bakar, Raihan Sabirah Sabri, Mohamad Yusof Darus, Shamsul Jamel Elias
2019 Bulletin of Electrical Engineering and Informatics  
Hence, the aim of this paper is to review different performance metric; covering the decoding, decrypting and extracting performance metric.  ...  This review is hoped to help future research in evaluating the performance analysis of natural language in general and the proposed secured data revealed on natural language steganography in specific.  ...  ACKNOWLEDGEMENTS The author wish to thank the Ministry of Higher Education Malaysia in funding grant under the University Grant Non-PI with S/O 13850, RIMC of Universiti Utara Malaysia, Kedah.  ... 
doi:10.11591/eei.v8i1.1441 fatcat:bboow5xn4favzpdk454i63g53i

Construction and covering properties of constant-dimension codes

Maximilien Gadouleau, Zhiyuan Yan
2009 2009 IEEE International Symposium on Information Theory  
In the rest of the paper we investigate the covering properties of CDCs.  ...  Moreover, we show that liftings of rank metric codes have the highest possible covering radius, and hence liftings of rank metric codes are not optimal packing CDCs.  ...  Finally, since the exact value of K R (q n−r , r, ρ) is in general unknown [16] , it is difficult to compare the upper bound in Proposition 4 to that in Proposition 2. 1.1 If k = 0, use the decoder for  ... 
doi:10.1109/isit.2009.5205850 dblp:conf/isit/GadouleauY09 fatcat:qxdrimki5vgezpwhostw7f7sqa

Covering b-Symbol Metric Codes and the Generalized Singleton Bound [article]

Hao Chen
2022 arXiv   pre-print
Some examples are given to show that the Delsarte bound and the Norse bound for covering codes in the Hamming metric are not true for covering codes in the pair metric.  ...  As an application the generalized Singleton bound on the sizes of list-decodable b-symbol codes is also presented. Then an upper bound on lengths of general MDS symbol-pair codes is proved.  ...  The generalized Singleton bound |C| ≤ Lq n−⌊ (L+1)d L ⌋ for (d, L) list-decodable Hamming metric codes was proved in [27] .  ... 
arXiv:2206.12668v1 fatcat:ptda5ef3wzfbngc72y2m66xi2m

Locality in Crisscross Error Correction [article]

Hedongliang Liu, Lukas Holzbaur, Antonia Wachter-Zeh
2018 arXiv   pre-print
The cover metric is suitable for describing the resilience against correlated errors in arrays, in particular crisscross errors, which makes it interesting for applications such as distributed data storage  ...  In this work, we consider codes designed for the cover metric that have locality, that means lost symbols can be recovered by using only a few other (local) symbols.  ...  Definition 2 gives the straightforward generalization of locality in block codes to codes in the cover-metric, as the cover-metric codes consider lines as the units in which errors/erasures occur.  ... 
arXiv:1806.07496v2 fatcat:a2s6icaf5bgvhbchrykm4r7sdi

Page 3601 of Mathematical Reviews Vol. , Issue 89F [page]

1989 Mathematical Reviews  
The author presents a model of a channel with orthographic errors. A metric similar to the Hamming metric is introduced and the maximum likelihood decoding is discussed.  ...  Further, Rcomp (the achievable rate region of sequential decoding) is the set of all points that are achievable by some metric.  ... 

Generalized Singleton Type Upper Bounds [article]

Hao Chen
2022 arXiv   pre-print
In this paper we give upper bounds on the sizes of (d, L) list-decodable codes in the Hamming metric space from various covering codes with the covering radius d.  ...  An upper bound on the lengths of list-decodable codes attaining the generalized Singleton bound is also presented.  ...  Covering code upper bounds We have the following covering code upper bound for the list-decodable codes in general finite metric spaces. Theorem 2.1 (General covering code upper bounds).  ... 
arXiv:2208.01138v4 fatcat:bd5idx6vgneeznn36am6tf7xai

OO Metric Analysis of Optimally Sparse LSBBased Steganography in E-Learning Environment

In general, while the sender sends their important documents to receiver through Internet, he/she encrypts the document which is decrypted by the receiver(s) at their end.  ...  Here we calculate the values of different metrics like CK and MOOD metrics based on the class diagram of our proposed model regarding the transmission of documents from administrator to learner  ...  INTRODUCTION In general, in an e-Learning environment, the sender sends the documents after applying encryption.  ... 
doi:10.35940/ijitee.k1911.0981119 fatcat:xzftxhdy6relppwovwe753pv3u

Weights which respect support and NN-decoding [article]

Roberto Assis Machado, Marcelo Firer
2019 arXiv   pre-print
In this work we explore a family of metrics over finite fields which respect the support of vectors.  ...  Finally we introduce the labeled-poset block metrics, a new family of metrics which respects support of vector, filling a gap existing in the known such metrics.  ...  The goal in this section, is to present an structured family of metrics that covers the remaining decoding criterion in Table I .  ... 
arXiv:1804.07809v2 fatcat:nrge5rqh2vcfdirfac7safaeu4

Properties of Codes with the Rank Metric [article]

Maximilien Gadouleau, Zhiyuan Yan
2006 arXiv   pre-print
In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular.  ...  We also establish bounds on the rank covering radius of maximal codes, and show that all MRD codes are maximal codes and all the MRD codes known so far achieve the maximum rank covering radius.  ...  The concept of rank covering radius is generalized in [12] , where the multi-covering radii of codes with the rank metric are defined.  ... 
arXiv:cs/0610099v2 fatcat:eidkuwoh3beelecaers2qgoita

Two-Step Image-in-Image Steganography via GAN

Guanzhong Wu, Xiangyu Yu, Hui Liang, Minting Li
2021 International Journal of Digital Crime and Forensics  
In previous works, the encoder-decoder structure is trained end-to-end, but in practice, encoder and decoder should be used separately.  ...  Therefore, end-to-end trained steganography networks are vulnerable to fluctuations and the secret decoded from those networks suffers from unpleasant noise.  ...  They used GAN to generate some images as cover, and hid secret in the generated images.  ... 
doi:10.4018/ijdcf.295814 fatcat:3xfmza4ch5ah7mermcwgozkasy

Construction and Covering Properties of Constant-Dimension Codes [article]

Maximilien Gadouleau, Zhiyuan Yan
2009 arXiv   pre-print
In the rest of the paper we investigate the covering properties of CDCs.  ...  Moreover, we show that liftings of rank metric codes have the highest possible covering radius, and hence liftings of rank metric codes are not optimal packing CDCs.  ...  We propose a decoding algorithm that either produces the unique codeword in E closest to R(A) in the subspace metric or returns a failure.  ... 
arXiv:0903.2675v1 fatcat:jmk47lwczvhgrncux34ffuzc2m

Multilayer crisscross error and erasure correction [article]

Umberto Martínez-Peñas
2022 arXiv   pre-print
Finally, some constructions of codes in the multi-cover metric are given, including dually MMCD codes, together with efficient decoding algorithms for them.  ...  To measure such errors and erasures, the multi-cover metric is introduced.  ...  Acknowledgement The author gratefully acknowledges the support from a María Zambrano contract by the University of Valladolid, Spain (Contract no. E-47-2022-0001486).  ... 
arXiv:2203.07238v1 fatcat:hn2ovcn6tngmrl2sfqlk2q663i

PixelSteganalysis: Destroying Hidden Information with a Low Degree of Visual Degradation [article]

Dahuin Jung, Ho Bae, Hyun-Soo Choi, Sungroh Yoon
2019 arXiv   pre-print
We evaluate our method using three public benchmarks in comparison with a conventional steganalysis method and show up to a 20% improvement in terms of decoding rate.  ...  Because the decoding method of deep learning-based steganography algorithms is approximate (lossy), which is different from the conventional steganography, we propose a new quantitative metric that is  ...  The second row shows the residual outputs between the cover image and the stego image generated by ISGAN.  ... 
arXiv:1902.11113v2 fatcat:cmchb6nhjbcmrbjteqpomfjjte
« Previous Showing results 1 — 15 out of 56,369 results