Deep Learning (DL) techniques for Natural Language Processing have been evolving remarkably fast. Recently, the DL advances in language modeling, machine translation, and paragraph understanding are ...so prominent that the potential of DL in Software Engineering cannot be overlooked, especially in the field of program learning. To facilitate further research and applications of DL in this field, we provide a comprehensive review to categorize and investigate existing DL methods for source code modeling and generation. To address the limitations of the traditional source code models, we formulate common program learning tasks under an encoder-decoder framework. After that, we introduce recent DL mechanisms suitable to solve such problems. Then, we present the state-of-the-art practices and discuss their challenges with some recommendations for practitioners and researchers as well.
Full text
Available for:
IZUM, KILJ, NUK, PILJ, SAZU, UL, UM, UPUK
Recently, the author has constructed families of MDS Euclidean self-dual codes from genus zero algebraic geometry (AG) codes. In the present correspondence, more families of optimal Euclidean ...self-dual codes from AG codes are explored. New families of MDS Euclidean self-dual codes of odd characteristic and those of almost MDS Euclidean self-dual codes are constructed explicitly from genus zero and genus one curves, respectively. More families of Euclidean self-dual codes are constructed from algebraic curves of higher genus.
Full text
Available for:
EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
An estimation method of pseudo-random (PN) codes in the periodic long code direct sequence spread spectrum signals using a pair of spreading code and scrambling code i.e. long scrambling code direct ...sequence spread spectrum (LSC-DSSS) is investigated in this study. Via the investigation of properties of triple correlation function (TCF) of m-sequences, the existence of common peaks in the TCFs of different m-sequences is proved, and the corresponding relationship between common peaks and primitive polynomials is further investigated. Four theorems are proposed as supplements of triple correlation theory and a novel estimation algorithm of the PN codes in LSC-DSSS signals is put forward on the basis of the theorems. With certain carrier frequency and chip rate of spreading code, this algorithm first eliminates the influence of information codes through delay-and-multiply operation. Then the TCF of signal is calculated, and the two PN codes in signal are successfully estimated finally by searching and using the common peak coordinates in the TCF. Simulation results show that the proposed algorithm exhibits excellent performance in estimating PN codes in LSC-DSSS signals.
Full text
Available for:
FZAB, GIS, IJS, KILJ, NLZOH, NUK, OILJ, SBCE, SBMB, UL, UM, UPUK
Algorithms have evolved from machine code to low-code-no-code (LCNC) in the past 20 years. Observing the growth of LCNC-based algorithm development, the CEO of GitHub mentioned that the future of ...coding is no coding at all. This paper systematically reviewed several of the recent studies using mainstream LCNC platforms to understand the area of research, the LCNC platforms used within these studies, and the features of LCNC used for solving individual research questions. We identified 23 research works using LCNC platforms, such as SetXRM, the vf-OS platform, Aure-BPM, CRISP-DM, and Microsoft Power Platform (MPP). About 61% of these existing studies resorted to MPP as their primary choice. The critical research problems solved by these research works were within the area of global news analysis, social media analysis, landslides, tornadoes, COVID-19, digitization of process, manufacturing, logistics, and software/app development. The main reasons identified for solving research problems with LCNC algorithms were as follows: (1) obtaining research data from multiple sources in complete automation; (2) generating artificial intelligence-driven insights without having to manually code them. In the course of describing this review, this paper also demonstrates a practical approach to implement a cyber-attack monitoring algorithm with the most popular LCNC platform.
Full text
Available for:
IZUM, KILJ, NUK, PILJ, PNG, SAZU, UL, UM, UPUK
<inline-formula> <tex-math notation="LaTeX">Z </tex-math></inline-formula>-complementary code set (ZCCS), an extension of perfect CCs, refers to a set of 2-D matrices having zero correlation zone ...properties. ZCCS can be used in various multi-channel systems to support, for example, quasi-synchronous interference-free multicarrier code-division multiple access communication and optimal channel estimation in multiple-input multiple-output systems. Traditional constructions of ZCCS heavily rely on a series of sequence operations which may not be feasible for rapid hardware generation particularly for long ZCCSs. In this paper, we propose a direct construction of ZCCS using the second-order Reed-Muller codes with efficient graphical representation. Our proposed construction, valid for any number of isolated vertices present in the graph, is capable of generating optimal ZCCS meeting the set size upper bound.
Motivated by communication channels in which the transmitted sequences are subjected to random permutations, as well as by certain DNA storage systems, we study the error control problem in settings ...where the information is stored/transmitted in the form of multisets of symbols from a given finite alphabet. A general channel model is assumed in which the transmitted multisets are potentially impaired by insertions, deletions, substitutions, and erasures of symbols. Several constructions of error-correcting codes for this channel are described, and bounds on the size of optimal codes correcting any given number of errors are derived. The construction based on the notion of Sidon sets in finite Abelian groups is shown to be optimal, in the sense of the asymptotic scaling of code redundancy, for any error radius and alphabet size. It is also shown to be optimal in the stronger sense of maximal code cardinality in various cases.
We propose a novel quantum turbo short-block code, which subsumes multiple-rate quantum short-block codes (MR-QSBCs) as the outer codes and a quantum unity-rate code (QURC) as the inner code. The ...proposed design is denoted as MR-QSBC-QURC. More specifically, the proposed design exhibits multiple quantum coding rates despite relying only on a single quantum encoder. Moreover, the flexibility offered by the single-encoder MR-QSBCs enables us to leverage extrinsic information transfer (EXIT)-chart based heuristic optimization for determining the optimal weighting in the fractional encoding of MR-QSBCs. Our simulation results show that the MR-QSBC-QURC scheme conceived performs relatively close to the ultimate limit of the quantum hashing bound. Specifically, when considering the target quantum coding rates of <inline-formula> <tex-math notation="LaTeX">r_{Q} = \lbrace 0.3, 0.4, 0.5, 0.6, 0.7 \rbrace </tex-math></inline-formula>, the MR-QSBC-QURC operates at a distance of <inline-formula> <tex-math notation="LaTeX">D = \lbrace 0.042, 0.029, 0.030, 0.024, 0.017 \rbrace </tex-math></inline-formula> from the quantum hashing bound, respectively, at a quantum bit error ratio (QBER) of 10−3.
This paper presents extended-domain Golomb (XDG) code, an extension of Golomb code for sparse geometric sources as well as a generalization of extended-domain Golomb-Rice (XDGR) code, based on the ...idea of almost instantaneous fixed-to-variable length (AIFV) codes. Showing that the XDGR encoding can be interpreted as extended usage of the code proposed in the previous works, this paper discusses the following two facts: The proposed XDG code can be constructed as an AIFV code relating to Golomb code as XDGR code does to Rice code; XDG and Golomb codes are symmetric in the sense of relative redundancy. The proposed XDG code can be efficiently used for losslessly compressing geometric sources too sparse for the conventional Golomb and Rice codes. According to the symmetry, its relative redundancy is guaranteed to be as low as Golomb code compressing non-sparse geometric sources. Awing to this fact, the parameter of the proposed XDG code, which is more finely tunable than the conventional XDGR code, can be optimized for given inputs using the conventional techniques. Therefore, it is expected to be more useful for many coding applications that deal with geometric sources at low bit rates.
Two-Layer QR Codes Tailing Yuan; Yili Wang; Kun Xu ...
IEEE transactions on image processing,
09/2019, Volume:
28, Issue:
9
Journal Article
Peer reviewed
Open access
A quick-response code (QR code) is a two-dimensional code akin to a barcode that encodes a message of limited length. In this paper, we present a variant of QR code, a two-layer QR code. Its ...two-layer structure can display two alternative messages when scanned from two different directions. We propose a method to generate such two-layer QR codes encoding two given messages in a few seconds. We also demonstrate the robustness of our method on both synthetic and fabricated examples. All source code will be made publicly available (https://github.com/yuantailing/two-layer-qrcode).
PDF
