检索结果-内蒙古大学图书馆

3rd International Conference on Information and Communication Technology ICoICT

作者： Barta, Janos Montemanni, Roberto Smith, Derek H. Univ Appl Sci Southern Switzerland Dalle Molle Inst Artificial Intelligence Galleria 2 CH-6928 Manno Switzerland Univ South Wales Div Math & Stat Pontypridd CF37 1DL M Glam Wales

ISBN: (纸本)9781479977529

This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbits of permutation groups in a new way. Several scientific works of recent years studied the principle of building feasible codes by combining the orbits of single permutation groups. However, the idea of combining orbits stemming from more than one group has not been explored yet. This paper presents some experiments and results with a multi-group approach. Furthermore, it explores the potential of using subsets of orbits (fragments) instead of entire orbits. The concept of minimum distance code is introduced and studied in the special case of the orbits of cyclic groups. Computational experiments carried out with a branch and bound algorithm show the potential of this approach to obtain new lower bounds on open MPCP problems.

关键词： coding theory permutation codes combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Review of Big Data Storage based on DNA Computing

Review of Big Data Storage based on DNA Computing

引用

2015 Asia-Pacific Conference on Computer Aided System Engineering

作者： Hakami, Hanadi Ahmed Chaczko, Zenon Kale, Anup Univ Technol Sydney Fac Engn & Informat Technol FEIT Ctr Real Time Informat Networks CRIN Sydney NSW Australia

ISBN: (纸本)9781479975884

There is a need of noteworthy scaling down in the information approached may be saved in the most recent decade. Delicate and advanced version hard paper duplicate which helps in two ways that they increased the effectiveness from claiming data management but also improved the distribution of entrance of information. On engineered DNA, it may be a chance to view the late improvement on the possibility about data capacity. Similarly in this way we have figured out how leap forward engineering could dramatically change the lifestyle out of our information capacity. This topic 'Big Data Storage based DNA' is described from the first research to newer one, their advantages and disadvantages, their techniques and how it will become a practice in the future. We also propose an approach is proposed as simple method to store data into DNA. The experiment work is done to validate the proposed approach result clearly show advantages merits of proposed method.

关键词： DNA DNA Computing Storage Based DNA coding theory Encoding DNA cloud

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Lee Distance Codes: New Bounds and Constructions

Asymmetric Lee Distance Codes: New Bounds and Constructions

引用

IEEE Information theory Workshop (ITW)

作者： Gabrys, Ryan Kiah, Han Mao Milenkovic, Olgica Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA

ISBN: (纸本)9781479955268

We continue our study of a new family of asymmetric Lee codes that arise in the design and implementation of emerging DNA-based storage systems and systems which use parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes, and have symbol distances dictated by their underlying binary representation. Our contributions include deriving new bounds for the size of the largest code in this metric based on Delsarte-like linear programming methods and describing new constructions for non-linear asymmetric Lee codes.

关键词： coding for DNA-based storage coding theory

来源：评论

学校读者我要写书评

暂无评论

Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem 40th

Randomized Polynomial Time Protocol for Combinatorial Slepia...

引用

40th International Symposium on Mathematical Foundations of Computer Science (MFCS)

作者： Chumbalov, Daniyar Romashchenko, Andrei Ecole Polytech Fed Lausanne Lausanne Switzerland LIRMM Montpellier France

ISBN: (纸本)9783662480540;9783662480533

We consider the following combinatorial version of the Slepian-Wolf coding scheme. Two isolated Senders are given binary strings X and Y respectively;the length of each string is equal to n, and the Hamming distance between the strings is at most an. The Senders compress their strings and communicate the results to the Receiver. Then the Receiver must reconstruct both strings X and Y. The aim is to minimise the lengths of the transmitted messages. The theoretical optimum of communication complexity for this scheme (with randomised parties) was found in [ 6], though effective protocols with optimal lengths of messages remained unknown. We close this gap and present for this communication problem a polynomial time randomised protocol that achieves the optimal communication complexity.

关键词： Slepian-Wolf coding Communication complexity coding theory Randomized encoding Pseudo-random permutations

来源：评论

学校读者我要写书评

暂无评论

Code Bending A New Creative coding Practice

引用

LEONARDO 2015年第1期48卷 25-31页

作者： Bergstrom, Ilias Lotto, R. Beau Univ Barcelona EventLAB Barcelona 08035 Spain UCL Lottolab Studio London EC1V 9EL England

Creative coding, or artistic creation through the medium of program instructions, is constantly gaining traction, and there is a steady stream of new resources emerging to support it. However, the question of how creative coding is carried out still deserves more attention. In what ways may the act of program development be rendered conducive to artistic creativity? As one possible answer to this question, the authors present and discuss a new creative coding practice, that of code bending, alongside examples and considerations regarding its applications.

关键词： ART & technology ART & computers coding theory COMPUTER-aided design COMPUTER programming SOFTWARE engineering

来源：评论

学校读者我要写书评

暂无评论

The List Decoding Radius of Reed-Muller Codes over Small Fields 15

The List Decoding Radius of Reed-Muller Codes over Small Fie...

引用

47th Annual ACM Symposium on theory of Computing (STOC) held as part of the Federated Computing Research Conference

作者： Bhowmick, Abhishek Lovett, Shachar Univ Texas Austin Dept Comp Sci Austin TX 78712 USA Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92103 USA

ISBN: (纸本)9781450335362

The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes. Fix a finite field F. The Reed-Muller code RM7(n, d) is defined by n-variate degree-d polynomials over F. In this work, we study the list decoding radius of Reed Muller codes over a constant prime field F = IFp, constant degree d and large n. We show that the list decoding radius is equal to the minimal distance of the code. That is, if we denote by (5(d) the normalized minimal distance of RMT (n, d), then the number of codewords in any ball of radius (5(d) s is bounded by c = c(p, d, s) independent of n. This resolves a conjecture of GopalanKlivans-Zuckerman [STOC 2008], who among other results proved it in the special case of F = F2;and extends the work of Gopalan [FOGS 2010] who proved the conjecture in the case of d = 2. We also analyse the number of codewords in balls of radius exceeding the minimal distance of the code. For e < d, we show that the number of codewords of RM7(n, d) in a ball of radius (5(e) s is bounded by exp(c " nd '), where c = c(p, d, 5) is independent of n. The dependence on n is tight. This extends the work of Kaufman-Lovett-Porat [IEEE Inf. theory 2012] who proved similar bounds over F2. The proof relies on several new ingredients: an extension of the Frieze-Kannan weak regularity to general function spaces, higher-order Fourier analysis, and an extension of the Schwartz-Zippel-DeMillo-Lipton lemma to compositions of polynomials.

关键词： coding theory weight distribution low degree polynomials list-decoding algorithm weak regularity higher order Fourier analysis Schwartz-Zippel extensions

来源：评论

学校读者我要写书评

暂无评论

Asymmetric Lee Distance Codes for DNA-Based Storage

Asymmetric Lee Distance Codes for DNA-Based Storage

引用

IEEE International Symposium on Information theory (ISIT)

作者： Gabrys, Ryan Kiah, Han Mao Milenkovic, Olgica Univ Illinois Coordinated Sci Lab Urbana IL USA Spawar Syst Ctr San Diego San Diego CA USA Nanyang Technol Univ Sch Phys & Math Sci Singapore Singapore

ISBN: (纸本)9781467377041

We consider a new family of asymmetric Lee codes that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes, and have symbol distances dictated by their underlying binary representation. Our contributions are two-fold. First, we derive upper bounds on the size of the codes under the asymmetric Lee distance measure based on linear programming techniques. Second, we propose code constructions which imply lower bounds.

关键词： coding for DNA-based storage coding theory

来源：评论

学校读者我要写书评

暂无评论

Non-malleable Reductions and Applications 15

Non-malleable Reductions and Applications

引用

47th Annual ACM Symposium on theory of Computing (STOC) held as part of the Federated Computing Research Conference

作者： Aggarwal, Divesh Dodis, Yevgeniy Kazana, Tomasz Obremski, Maciej Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland NYU Comp Sci Dept New York NY 10003 USA Univ Warsaw Inst Informat Warsaw Poland

ISBN: (纸本)9781450335362

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is impossible;for example, when the attacker can completely overwrite the encoded message. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely "unrelated value". Although such codes do not exist if the family of "tampering functions" F allowed to modify the original codeword is completely unrestricted, they are known to exist for many broad tampering families T. The family which received the most attention [DPW10, LL12, DKO13, ADL14, CG14a, CG14b] is the family of tampering functions in the so called (2-part) split-state model: here the message x is encoded into two shares L and R, and the attacker is allowed to arbitrarily tamper with each L and R individually. Despite this attention, the following problem remained open: Build efficient, information-theoretically secure non-malleable codes in the split-state model with constant encoding rate: vertical bar L vertical bar = vertical bar R vertical bar = O (vertical bar x vertical bar). In this work, we resolve this open problem. Our technique for getting our main result is of independent interest. We (a) develop a generalization of non-malleable codes, called non-malleable reductions;(b) show simple composition theorem for non-malleable reductions;(c) build a variety of such reductions connecting various (independently interesting) tampering families F to each other;(d) construct several new non-malleable codes in the split state model by applying the composition theorem to a series of easy to understand reductions. Most importantly, we show several "independence amplification" reductions, showing how to reduce split-state tampering of very few parts to an easier question of split-state tampering with a much larger number of parts. In particular

关键词： non malleable codes tamper-resilient cryptography coding theory

来源：评论

学校读者我要写书评

暂无评论

Communication theory and Signal Processing for Transform coding 1

引用

丛书名： []

2014年

作者： Khamies Mohammed Ali El-Shennawy

ISBN: (数字)9781608058303

ISBN: (纸本)9781608058310

This book is tailored to fulfil the requirements in the area of the signal processing in communication systems. The book contains numerous examples, solved problems and exercises to explain the methodology of Fourier Series, Fourier Analysis, Fourier Transform and properties, Fast Fourier Transform FFT, Discrete Fourier Transform DFT and properties, Discrete Cosine Transform DCT, Discrete Wavelet Transform DWT and Contourlet Transform CT. The book is characterized by three directions, the communication theory and signal processing point of view, the mathematical point of view and utility computer programs. The contents of this book include chapters in communication system and signals, Fourier Series and Power Spectra, Fourier Transform and Energy Spectra, Fourier Transform and Power Spectra, Correlation Function and Spectral Density, Signal Transmission and Systems, Hilbert Transform, Narrow Band-Pass Signals and Systems and Numerical Computation of Transform coding. This book is intended for undergraduate students in institutes, colleges, universities and academies who want to specialize in the field of communication systems and signal processing. The book will also be very useful to engineers of graduate and post graduate studies as well as researchers in research centers since it contains a great number of mathematical operations that are considered important in research results.

关键词： coding theory

来源：评论

学校读者我要写书评

暂无评论

Capacity-achieving coding mechanisms: Spatial coupling and group symmetries

Capacity-achieving coding mechanisms: Spatial coupling and g...

引用

作者： Vanaparthy, Santhosh Kumar Texas A&M University

学位级别：Ph.D.

The broad theme of this work is in constructing optimal transmission mechanisms for a wide variety of communication systems. In particular, this dissertation provides a proof of threshold saturation for spatially-coupled codes, low-complexity capacity-achieving coding schemes for side-information problems, a proof that Reed-Muller and primitive narrow-sense BCH codes achieve capacity on erasure channels, and a mathematical framework to design delay sensitive communication systems. Spatially-coupled codes are a class of codes on graphs that are shown to achieve capacity universally over binary symmetric memoryless channels (BMS) under belief-propagation decoder. The underlying phenomenon behind spatial coupling, known as “threshold saturation via spatial coupling”, turns out to be general and this technique has been applied to a wide variety of systems. In this work, a proof of the threshold saturation phenomenon is provided for irregular low-density parity-check (LDPC) and low-density generator-matrix (LDGM) ensembles on BMS channels. This proof is far simpler than published alternative proofs and it remains as the only technique to handle irregular and LDGM codes. Also, low-complexity capacity-achieving codes are constructed for three coding problems via spatial coupling: 1) rate distortion with side-information, 2) channel coding with side-information, and 3) write-once memory system. All these schemes are based on spatially coupling compound LDGM/LDPC ensembles. Reed-Muller and Bose-Chaudhuri-Hocquengham (BCH) are well-known algebraic codes introduced more than 50 years ago. While these codes are studied extensively in the literature it wasn’t known whether these codes achieve capacity. This work introduces a technique to show that Reed-Muller and primitive narrow-sense BCH codes achieve capacity on erasure channels under maximum a posteriori (MAP) decoding. Instead of relying on the weight enumerators or other precise details of these codes, this technique requi

关键词： Information theory coding theory Wireless Communications Thesis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：