相关论文: Identification Codes via Prime Numbers

To equip DNA-based data storage with random-access capabilities, Yazdi et al. (2018) prepended DNA strands with specially chosen address sequences called primers and provided certain design criteria for these primers. We provide explicit…

Consider the problem of constructing a polar code of block length $N$ for the transmission over a given channel $W$. Typically this requires to compute the reliability of all the $N$ synthetic channels and then to include those that are…

Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

A coding scheme for two-page unrestricted-rate PRIO code that each page may have different code rates is proposed. In the second page, the code for each messages consists of two complementary codewords with code length n. There are a total…

Channel polarization, originally proposed for binary-input channels, is generalized to arbitrary discrete memoryless channels. Specifically, it is shown that when the input alphabet size is a prime number, a similar construction to that for…

At ITW'10, Bringer et al. suggest to strengthen their previous identification protocol by extending the Code Reverse Engineering (CRE) problem to identification codes. We first extend security results by Tillich et al. on this very problem.…

LLM-based code generation could save significant manual efforts in industrial automation, where control engineers manually produce control logic for sophisticated production processes. Previous attempts in control logic code generation…

In models to generate program source code from natural language, representing this code in a tree structure has been a common approach. However, existing methods often fail to generate complex code correctly due to a lack of ability to…

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work…

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…

A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after some constant…

Polar codes can theoretically achieve very competitive Frame Error Rates. In practice, their performance may depend on the chosen decoding procedure, as well as other parameters of the communication system they are deployed upon. As a…

Reconstruction codes are generalizations of error-correcting codes that can correct errors by a given number of noisy reads. The study of such codes was initiated by Levenshtein in 2001 and developed recently due to applications in modern…

We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically codes that are uniquely decodable from $\frac{1-\varepsilon}{2}$ fraction of errors and list decodable from $1-\varepsilon$ fraction of…

The problem to construct optimal conflict-avoiding codes of even lengths and the Hamming weight $3$ is completely settled. On the contrary, it is still open for odd lengths. It turns out that the prime lengths are the fundamental cases…

We propose a multi-scale analysis method for studying arithmetic properties of integer sets, such as primality. Our approach organizes information through a hierarchy of nested sequences, where each level enables a hierarchical expression…

In order to avoid unnecessary applications of Miller-Rabin algorithm to the number in question, we resort to trial division by a few initial prime numbers, since such a division take less time. How far we should go with such a division is…

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

We develop a framework for studying the problem of identifying roots of a noisy function. We revisit a previous logarithmic bound on the number of observations and propose a general problem for identification of roots with three errors. As…