Random Coding Research Articles

Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval

Private information retrieval protocols guarantee that a user can <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">privately</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">losslessly</i> retrieve a single file from a database stored across multiple servers. In this work, we propose to simultaneously relax the conditions of perfect retrievability and privacy in order to obtain improved download rates when all files are stored uncoded on a single server. Information leakage is measured in terms of the average success probability for the server of correctly guessing the identity of the desired file. The main findings are: i) The derivation of the optimal tradeoff between download rate, distortion, and information leakage when the file size is <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">infinite</i> . Closed-form expressions of the optimal tradeoff for the special cases of “no-leakage” and “no-privacy” are also given. ii) A novel approach based on linear programming (LP) to construct schemes for a finite file size and an arbitrary number of files. The proposed LP approach can be leveraged to find provably optimal schemes with corresponding closed-form expressions for the rate-distortion-leakage tradeoff when the database contains at most four bits. Finally, for a database that contains 320 bits, we compare two construction methods based on the LP approach with a nonconstructive scheme downloading subsets of files using a finite-length lossy compressor based on random coding.

Wireless Communication Strategy with BATS Codes for Butterfly Network

In this paper, two transmission schemes for batched sparse(BATS) codes based on a multicast protocol in a butterfly network are studied. For both of the schemes, a source file is first segmented into several packets at the source node, which are then coded with outer coder of the BATS codes to generate potentially unlimited batches. Rather than the linear network, in which the packets are directly transmitted to the next node, the packets will be forwarded to multiple nodes in the butterfly network. All the intermediate nodes which receive the packets recode them with random linear network coding (RLNC). At the destination node receivers, the sink node decodes the packets transmitted from different links. The Scheme I requires the intermediate nodes to recode the packets until all of them are received. On the contrary, the intermidate nodes of Scheme II just recode the packets as soon as receiving them and forward the recoded packets to the next node immediately. The Belief Propagation(BP) decoders of these two schemes are studied and applied to Scheme I and Scheme II respectively. The simulation results show that Scheme I consumed fewer batches than Scheme II, which indicates Scheme I outperforms Scheme II.

Transmission Control Protocol Analysis Using NS3

The NS-3 Test Framework provides a focus on multidisciplinary development and high-level design, and is now being used by various experts around the world. Surprisingly, its Data Collection Protocol (DCP) implementation is late and is not planned to be used as a reference point for Transmission Control Protocol (TCP), focused research, where the Herald has provided NS-3 to accept NS-2 submissions. The latest-best configuration consists of a number of PCs connected to each other by two sweets and switches. As a result of the overlapping character, being a significant number of PCs, channels can create a complex problem. If a case of sensitivity is sent to the TCP bundles, each word flow should be taken with the appropriate treatment when there is a deadline. Drop-tail is a common scheme for using the power of measurement, and with this provision, the feeling cannot be limited to the illumination of long lines, which increases the delay in these methods. As a result, the flow efficiency decreases. The Board Active Queue Management (AQM) is largely oblivious to the fact that conspiracy and sensitivity are not the basic mechanisms that must be considered in solving this major problem. Another area to look for is depression, and the range of serious problems. In this work, a framework was developed based on drop- tail and different active queue management schemes such as DLP, Drop-Tail delivers, Packet First in First Out (PFIFO), Random Early Detection (RED) and Code Exploration Introduction. The evaluation is performed using an open-framework framework (NS-3) assessment framework. In the end, the results of the review suggest that Code and RED, a unique line of management figures, have shown much needed performance.

Proof-of-principle demonstration of sequential 3 → 1 quantum random access code via cascaded measurements.

Quantum random access code (QRAC) serves the communication task to encode a long message into a quantum system and allow the receiver to decode the initial information with a higher success probability than classical random access code (RAC). Here, we present an experimental demonstration of sequential 3 → 1 QRAC in the prepare-transform-measure scenario with one sender and three independent receivers. The experimental results show that, in the 3 → 1 QRAC scenario, three receivers can independently decode the initial information with an average success probability higher than the classical RAC.

Alien Pulse Rejection in Concurrent Firing LIDAR

Mobile pulse light detection and ranging (LIDAR) is an essential component of autonomous vehicles. The obstacle detection function of autonomous vehicles requires very low failure rates. With an increasing number of autonomous vehicles equipped with LIDAR sensors for use in the detection and avoidance of obstacles and for safe navigation through the environment, the probability of mutual interference becomes an important issue. The reception of foreign laser pulses can lead to problems such as ghost targets or a reduced signal-to-noise ratio (SNR). In this paper, we presented the probability that any LIDAR sensor would interfere mutually by considering spatial and temporal overlaps. We presented some typical mutual interference scenarios in real-world vehicle applications, as well as an analysis of the interference mechanism. We proposed a new multi-plane LIDAR sensor which used coded pulse streams encoded by carrier-hopping prime code (CHPC) technology to measure surrounding perimeters without mutual interference. These encoded pulses utilized a random azimuth identification and checksum with random spreading code. We modeled the entirety of the LIDAR sensor operation in Synopsys OptSim and represented the alien pulse elimination functionality obtained via modeling and simulation.

Semi-blinded design in clinical trials

The semi-blinded design can be applied for the adaptive design in clinical trials. According the the FDA guidance, an adaptive clinical design study would modify the study design and hypotheses based on the analysis of accrued data. An independent Data Monitoring Committee analyzes the unblinded data in the middle of a clinical trial and makes recommendations to the sponsor if any action is needed. The unblinded interim analysis could potentially introduce bias and put the integrity of the trial at risk. The proposed methodology is technically blinded for the interim analysis. In fact, actual treatment labels are not released. It is based on a treatment re-labeling approach in which the dummy treatments associated with the actual treatments via a pre-specified transition probability matrix are released in the dataset. The semi-blinded test statistic depends on this transition probability matrix. However, it can be evaluated without knowing the transition probability matrix if this matrix is a Latin square. As the stagnation probability approach to 0.5, the more information we will lose. It will lead to obtain a lower power of testing hypothesis, and may not be able to show the utility or efficacy of study treatment if this probability is close to 0.5. The higher the stagnation probability, the higher disclosure risk we have. The randomization codes may be broken as the stagnation probability approach to 1. The sponsor should strike a balance between the statistical power and disclosure risk.

Optically Transparent Low Scattering Metasurface Based on Polarization Conversion‐Diffusion‐Absorption Integration Mechanism

AbstractIn this paper, an optically transparent low‐scattering metasurface combining polarization conversion, diffusion, and absorption mechanisms is proposed. Firstly, a polarization conversion absorbing meta‐atom is designed, and its reflection coefficient is optimized based on equivalent circuit theory and genetic algorithm. Then, by arranging the meta‐atom and its orthogonal structural meta‐atom according to the random coding sequence, the metasurface is constructed, realizing the design concept of co‐polarization absorption and cross‐polarization diffusion. The simulation results are in good agreement with the measured results and the Radar Cross Section (RCS) reduction of more than −10 and −25 dB can be realized in the co‐polarized and cross‐polarized directions in 3.3–12.3 GHz, respectively. Moreover, the amplitude and bandwidth of RCS reduction of the metasurface can be maintained well in the 0–40° oblique incidence range.

Bounds for List-Decoding and List-Recovery of Random Linear Codes

A family of error-correcting codes is list-decodable from error fraction $p$ if, for every code in the family, the number of codewords in any Hamming ball of fractional radius $p$ is less than some integer $L$ that is independent of the code length. It is said to be list-recoverable for input $\ell$ if for every sufficiently large subset of codewords (of $L$ or more), there is a coordinate where the codewords take more than $\ell$ values. The parameter $L$ is said to be the list size in either case. The capacity, i.e., the largest possible rate for these notions as the $L \to \infty$, is known to be $1-h_q(p)$ for list-decoding, and $1-\log_q \ell$ for list-recovery, where $q$ is the alphabet of the code family. In this work, we study the of random linear codes for both list-decoding and list-recovery as the rate approaches capacity. We show the following claims hold with high probability over the choice of the code (below, $\epsilon > 0$ is the gap to capacity). (1) A random linear code of rate $1 - \log_q(\ell) - \epsilon$ requires $L \ge \ell^{\Omega(1/\epsilon)}$ for list-recovery from input $\ell$. This is surprisingly in contrast to completely random codes, where $L = O(\ell/\epsilon)$ suffices w.h.p. (2) A random linear code of rate $1 - h_q(p) - \epsilon$ requires $L \ge \lfloor h_q(p)/\epsilon+0.99 \rfloor$ for list-decoding from error fraction $p$, when $\epsilon$ is sufficiently small. (3) A random binary linear code of rate $1 - h_2(p) - \epsilon$ is list-decodable from average error fraction $p$ with with $L \leq \lfloor h_2(p)/\epsilon \rfloor + 2$. The second and third results together precisely pin down the sizes for binary random linear codes for both list-decoding and average-radius list-decoding to three possible values.

Ultrafast Secure Key Distribution Based on Random DNA Coding and Electro-Optic Chaos Synchronization

We propose and numerically demonstrate an ultrafast secure key distribution based-on random DNA coding and the chaos synchronization in two identical electro-optic oscillators (EO) with common injection. High-quality synchronization between the responses of EOs with extremely sensitivity to the mismatching of time delay and phase bias is observed. It is noted that the random DNA coding and the delay DNA-XOR in the post-processing can greatly amplify the randomness of the synchronized sequences acquired by symmetrically dual-threshold sampling the correlated physical entropies, and enhance the security of key distribution by providing additional encryption. According to our study, high rate key distribution of over 10 Gb/s can be fulfilled with a good consistency, which can be used for the commercial communication networks.

Threshold Rates for Properties of Random Codes

Suppose that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> is a property that may be satisfied by a random code <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$C \subset \Sigma ^{n}$ </tex-math></inline-formula> . For example, for some <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$p \in (0,1)$ </tex-math></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> might be the property that there exist three elements of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula> that lie in some Hamming ball of radius <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$pn$ </tex-math></inline-formula> . We say that <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R^{\ast}$ </tex-math></inline-formula> is the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">threshold rate</i> for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> if a random code of rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R^{\ast} + \varepsilon $ </tex-math></inline-formula> is very likely to satisfy <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> , while a random code of rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R^{\ast} - \varepsilon $ </tex-math></inline-formula> is very unlikely to satisfy <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> . While random codes are well-studied in coding theory, even the threshold rates for relatively simple properties like the one above are not well understood. We characterize threshold rates for a rich class of properties. These properties, like the example above, are defined by the inclusion of specific sets of codewords which are also suitably “symmetric.” For properties in this class, we show that the threshold rate is in fact <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">equal</i> to the lower bound that a simple first-moment calculation obtains. Our techniques not only pin down the threshold rate for the property <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {P}$ </tex-math></inline-formula> above, they give sharp bounds on the threshold rate for list-recovery in several parameter regimes, as well as an efficient algorithm for estimating the threshold rates for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">list-recovery</i> in general.

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes

We give new constructions of two classes of algebraic code families that are efficiently list decodable with small output list size from a fraction 1-R-ε of adversarial errors, where R is the rate of the code, for any desired positive constant ε. The alphabet size depends only ε and is nearly optimal. The first class of codes are obtained by folding algebraic-geometric codes using automorphisms of the underlying function field. The second class of codes are obtained by restricting evaluation points of an algebraic-geometric code to rational points from a subfield . In both cases, we develop a linear-algebraic approach to perform list decoding, which pins down the candidate messages to a subspace with a nice “periodic” structure. To prune this subspace and obtain a good bound on the list size, we pick subcodes of these codes by pre-coding into certain subspace-evasive sets that are guaranteed to have small intersection with the sort of periodic subspaces that arise in our list decoding. We develop two approaches for constructing such subspace-evasive sets. The first is a Monte Carlo construction of hierearchical subspace-evasive (h.s.e.) sets that leads to excellent list size but is not explicit. The second approach exploits a further ultra-periodicity of our subspaces and uses a novel construct called subspace designs , which were subsequently constructed explicitly and also found further applications in pseudorandomness. To get a family of codes over a fixed alphabet size, we instantiate our approach with algebraic-geometric codes based on the Garcia–Stichtenoth tower of function fields. Combining this with pruning via h.s.e. sets yields codes list-decodable up to a 1-R-ε error fraction with list size bounded by O (1/ε), matching the existential bound for random codes up to constant factors. Further, the alphabet size can be made exp ( Õ (1/ε 2 )), which is not much worse than the lower bound of exp (Ω (1/ε)). The parameters we achieve are thus quite close to the existential bounds in all three aspects (error-correction radius, alphabet size, and list size) simultaneously. This construction is, however, Monte Carlo and the claimed list-decoding property only holds with high probability. Once the code is (efficiently) sampled, the encoding/decoding algorithms are deterministic with a running time O _ε ( N c ) for an absolute constant c , where N is the code’s block length. Using subspace designs instead for the pruning, our approach yields the first deterministic construction of an algebraic code family of rate R with efficient list decoding from 1-R-ε fraction of errors over an alphabet of constant size exp (Õ(1/ε 2 )). The list-size bound is upper bounded by a very slowly growing function of the block length N ; in particular, it is at most O(log ( r ) N ) (the r th iterated logarithm) for any fixed integer r . The explicit construction avoids the shortcoming of the Monte Carlo sampling at the expense of a slightly worse list size.

Метод биометрической аутентификации на основе кепстральных характеристик эхограмм наружного уха и нейросетевого преобразователя биометрия-код

Open biometric images (fingerprint, iris, face) are "in sight" and therefore compromised in the natural environment. In this work, it is proposed to use data on the internal structure of the outer ear obtained using echography as biometric images. The individual characteristics of the ear canal of subjects are hidden from direct observation and cannot be copied by photographing. The proposed authentication method is based on cepstral analysis of echograms of the ear canal using neural network biometrics to code converters, trained in accordance with GOST R 52633.5. The neural network biometrics-code converter allows you to associate a user's cryptographic key or password with his biometric image. This is a shallow neural network of one or two layers of neurons, which is configured to generate a key specified during training when an image of a known user arrives, and when an unknown image arrives at its inputs, generate a random code with high entropy. At the entrance to this network, cepstral signs of echograms were received. To apply the method in practice, you need a special device that combines a headphone with a sound-proof housing and a microphone. The results obtained can be called optimistic EER = 0.031 (FAR = 0.001 at FRR = 0.23). The use of neural network converters biometrics-code showed a relatively higher percentage of errors in comparison with multilayer neural networks and the naive Bayes classification scheme, however, neural network biometrics to code converters allows you to implement authentication in a protected mode. This means that the subject's biometric data will be protected from compromise at the stages of storage, execution and transmission via communication channels.

A Fault-Tolerant Transmission Scheme in SDN-Based Industrial IoT (IIoT) over Fiber-Wireless Networks.

Driven by the emerging mission-critical and data-intensive applications in industrial intelligent manufacturing, the software-defined network (SDN) based fiber-wireless access network (FiWi) is attracting considerable attention thanks to its capability of central control and large bandwidth. However, the heterogeneity of the network leads to new challenges, since the packet loss can be caused either by the poor channel quality of wireless links or network component failures. A novel and adaptive mechanism combining sparse random linear network coding with parallel transmission (SNC-PT) is proposed to achieve the fault-tolerance against high packet loss rate and any network element malfunction. We illustrate the benefits of using the SNC-PT mechanism to improve fault tolerance by characterizing the network performance with respect to the completion time and goodput along with its relationship to channel quality and node failures. We show that significant performance gains can be obtained in comparison with conventional uncoded transmission based on transmission control protocol (TCP). The simulation results show that the SNC-PT mechanism is fault-tolerant, while it can significantly shorten the data transmission completion time to at least 12% of the baseline and increase the goodput by about 10% compared to other coding schemes such as random linear network coding.

A GDPR-Compliant Partner Notification Service.

Partner Notification processes focus on the notification of sexual partners to prevent the transmission of Sexually Transmitted Infections (STIs). The INTEGRATE Joint Action provides an integrated platform called RiskRadar, for combination prevention activities targeting STIs, including an anonymous, free and voluntary Partner Notification service. The presented service information flow ensures privacy, security and GDPR compliance which were identified as vital with similar tools. The service is available via web and mobile interfaces using a unique random code provided from authorised healthcare professionals to support privacy.

Id-PC: An Identification Scheme based on Polar Codes

ABSTRACT In this paper, two polar code-based identification schemes are proposed in which the polar codes are used instead of random codes. The security of the proposed identification schemes is based on the hardness of coding problems such as general decoding problem (GDP) and syndrome decoding problem (SDP). By exploiting the properties of polar codes in the proposed identification schemes, it does not need to save the parity check or generator matrix of polar codes completely as a public data. Therefore, the public data size of the proposed identification schemes is reduced up to 90% in comparison with the Stern and Veron identification schemes. Also, by using the efficient techniques of seed generation and compression, it is shown that the communication costs of the proposed identification schemes are reduced up to 53% compared to the Stern and Veron identification schemes. Moreover, security analyses show that the proposed identification schemes have low cheating probability and also have proper resistance against information set decoding attack.

Lightweight network-coded ARQ: An approach for Ultra-Reliable Low Latency Communication

Sliding Window RLNC schemes represent a novel, promising and efficient class of algorithms for reliable data transmission over an unreliable link. They combine Random Linear Network Coding (RLNC) with the idea of sliding window from (Automatic Repeat reQuest) ARQ protocols in order to help the basic ARQ mechanism to quickly recover from losses through redundant coded packets. Although very successful, we make the observation that such schemes bear significant limitations stemming from the fact that both the ARQ mechanism and the coding process operate on the same group of packets, called the sliding window. To tackle the problem, we propose the use of two distinct windows; the sliding window, which can be used to optimize the data flow based on the link’s bandwidth-delay product, and the coding window that can be used exclusively in the coding process. We analyze the performance of the proposed strategy and show that it provides an improved coding operation while at the same time reduces the coding complexity. Then, we delineate rapidARQ, a sliding window RLNC protocol that adopts the proposed strategy, and experimentally confirm that it outperforms other state-of-the-art sliding window RLNC schemes. More specifically, it achieves superior throughput-delay performance that better fits in the context of Ultra-Reliable Low-Latency Communication (URLLC) while at the same time it significantly reduces the coding complexity. Moreover, we show that the superior performance of rapidARQ is more prominent in channels with large bandwidth-delay products, a fact that renders its utility to current and future networks more essential.

Coded Aperture Imaging Based on Random Code and Back Propagation Neural Network

Coded Aperture Imaging Based on Random Code and Back Propagation Neural Network

Multifeature Face Template Protection Method Based on Double Random Phase Coding

Multifeature Face Template Protection Method Based on Double Random Phase Coding

Semi-device-independent randomness certification with partially free random sources using $$4\rightarrow 1$$ quantum random access code

Semi-device-independent randomness certification with partially free random sources using $$4\rightarrow 1$$ quantum random access code

Double-image encryption algorithm based on discrete fractional angular transform and fractional Fourier transform

By combining fractional Fourier transform with discrete fractional angular transform, a double-image encryption algorithm is designed. The discrete cosine transform is performed on two grayscale images to generate a spectrum image, and then the generated spectrum image is compressed into an image with Zigzag scanning. The compressed image is processed with the discrete fractional angular transform, and then fractional Fourier transform and double random phase coding are executed on the image. The DNA operation controlled by chaotic system is introduced to change the pixel values. Finally, the ciphertext image is obtained through bit-level permutation and pixel adaptive diffusion. The statistical information of the plaintext images is employed as the input of the SHA-256 to calculate the initial conditions of the chaotic map. Simulation experiments demonstrate that the double-image encryption algorithm can effectively reduce the correlation among adjacent pixels of the plaintext images.