726 results
Search Results
2. Analytical Solution for Bearing Capacity of Reinforced Strip Footings on Unsaturated Soils under Steady Flow.
- Author
-
Kang, Xudong and Zhou, De
- Subjects
- *
REINFORCED soils , *BEARING capacity of soils , *SOILS , *SOIL mechanics , *ANALYTICAL solutions - Abstract
The study of analytical solutions for the bearing capacity of reinforced soil foundations is a very important topic in engineering mathematics. Existing evaluations of the foundation-bearing capacity on reinforced soils are based on dry conditions, while many foundations are located on unsaturated soils in real engineering. In this paper, a new formula for the bearing capacity of reinforced strip footings on unsaturated soils is presented. Two sliding failure mechanisms are constructed based on the position of the reinforcement layer relative to the sliding surface. The distribution of apparent cohesion in the depth direction is calculated by considering the effect of matrix suction. By additionally considering the work conducted by the reinforcement and the contribution of the apparent cohesion, the bearing capacity formula is obtained using the upper bound theorem of limit analysis. The bearing capacity solution is obtained by adopting the sequential quadratic programming (SQP) algorithm. Comparing the results under two failure mechanisms, the optimal bearing capacity and the optimal embedment depth of reinforcement are obtained. The results of this paper are consistent with those of the existing literature. Finally, the effects of reinforcement embedment depth, effective internal friction angle, uniform load, and unsaturated soil parameters on the optimal bearing capacity are investigated through parametric analysis. This paper provides useful recommendations for the engineering application of reinforced strip footings on unsaturated soils. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Bounds on Performance for Recovery of Corrupted Labels in Supervised Learning: A Finite Query-Testing Approach.
- Author
-
Seong, Jin-Taek
- Subjects
- *
SUPERVISED learning , *ARTIFICIAL neural networks , *FINITE fields , *ERROR probability , *SUBSET selection - Abstract
Label corruption leads to a significant challenge in supervised learning, particularly in deep neural networks. This paper considers recovering a small corrupted subset of data samples which are typically caused by non-expert sources, such as automatic classifiers. Our aim is to recover the corrupted data samples by exploiting a finite query-testing system as an additional expert. The task involves identifying the corrupted data samples with minimal expert queries and finding them to their true label values. The proposed query-testing system uses a random selection of a subset of data samples and utilizes finite field operations to construct combined responses. In this paper, we demonstrate an information-theoretic lower bound on the minimum number of queries required for recovering corrupted labels. The lower bound can be represented as a function of joint entropy with an imbalanced rate of data samples and mislabeled probability. In addition, we find an upper bound on the error probability using maximum a posteriori decoding. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. On Propeties of the LIP Model in the Class of RCPSPs.
- Author
-
Kibzun, Andrey I. and Rasskazova, Varvara A.
- Subjects
- *
INTEGER programming , *LIPS , *LINEAR programming , *COMPUTATIONAL complexity , *PROBLEM solving - Abstract
The Resource-Constrained Project Scheduling Problem (RCPSP) is a significant and important issue in the field of project management. It arises during project planning when resources must be allocated among tasks with specific time constraints. Solving this problem enables the optimization of project execution time, minimization of resource costs, and increased efficiency of the entire team's work. Due to the increasing complexity of projects, the development of new methods and algorithms to solve RCPSP is relevant nowadays. The existing methods for obtaining approximate solutions with guaranteed accuracy are characterized by high computational complexity and are often ineffective in considering the specific constraints of the problem. Fast heuristic approaches also have several drawbacks related to fine-tuning algorithm parameters and strong dependence on the quality of the initial solution. This paper investigates the features of the linear integer programming (LIP) model to solve RCPSP. The proposed LIP model is universal and scalable, enabling it to fully consider all specific aspects of the problem. The paper provides a construction algorithm of a functional space of the model and discusses the estimation of complexity. From the estimation of the mentioned algorithm's complexity, it is observed that the general complexity of the proposed approach is proportional to a controlled parameter of the LIP. Increasing this controlled parameter can significantly reduce the dimensionality of the initial problem, thus leading to the effectiveness of the LIP model-based approach in terms of computational resources. An upper bound for the value of this parameter is obtained for a special case of the RCPSP. Using the obtained balanced value, a numerical experiment was carried out on real-world samples. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. Bounds on the Clique and the Independence Number for Certain Classes of Graphs.
- Author
-
Brimkov, Valentin E. and Barneva, Reneta P.
- Subjects
- *
INDEPENDENT sets , *REGULAR graphs - Abstract
In this paper, we study the class of graphs G m , n that have the same degree sequence as two disjoint cliques K m and K n , as well as the class G ¯ m , n of the complements of such graphs. The problems of finding a maximum clique and a maximum independent set are NP-hard on G m , n . Therefore, looking for upper and lower bounds for the clique and independence numbers of such graphs is a challenging task. In this article, we obtain such bounds, as well as other related results. In particular, we consider the class of regular graphs, which are degree-equivalent to arbitrarily many identical cliques, as well as such graphs of bounded degree. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. On the Best Simultaneous Approximation in the Bergman Space.
- Author
-
Shabozov, M. Sh.
- Subjects
- *
APPROXIMATION theory , *BERGMAN spaces , *ANALYTIC functions , *POLYNOMIAL approximation , *INTEGRAL functions , *PERIODIC functions - Abstract
We study extremal problems related to the best joint polynomial approximation of functions analytic in the unit disk and belonging to the Bergman space . The problem of joint approximation of periodic functions and their derivatives by trigonometric polynomials was considered by Garkavy [1] in 1960. Then, in the same year, Timan [2] considered this problem for classes of entire functions defined on the entire axis. The problem of joint approximation of functions and their derivatives is considered in more detail in Malozemov's monograph [3], where some classical theorems of the theory of approximation of functions are presented and generalized. In the present paper, a number of exact theorems are obtained and sharp upper bounds for the best joint approximations of a function and its successive derivatives by polynomials and their respective derivatives on some classes of complex functions belonging to the Bergman space are calculated. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Sequential Transmission Over Binary Asymmetric Channels With Feedback.
- Author
-
Yang, Hengjie, Pan, Minghao, Antonini, Amaael, and Wesel, Richard D.
- Subjects
- *
MONTE Carlo method , *MARKOV processes , *MEMORYLESS systems , *NEURAL codes - Abstract
In this paper, we consider variable-length coding over the memoryless binary asymmetric channel (BAC) with full noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et al. introduced a coding scheme, which we refer to as the small-enough-difference (SED) coding scheme. For symmetric binary-input channels, the deterministic variable-length feedback (VLF) code constructed with the SED coding scheme asymptotically achieves both capacity and Burnashev’s optimal error exponent. Building on the work of Naghshvar et al., this paper extends the SED coding scheme to the BAC and develops a non-asymptotic VLF achievability bound that is shown to achieve both capacity and the optimal error exponent. For the specific case of the BSC, we develop an additional non-asymptotic VLF achievability bound using a two-phase analysis that leverages both a submartingale synthesis and a Markov chain time of first passage analysis. Numerical evaluations show that both new VLF achievability bounds outperform Polyanskiy’s achievability bound for variable-length stop-feedback codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth.
- Author
-
Smarandache, Roxana and Mitchell, David G. M.
- Subjects
- *
TANNER graphs , *PARITY-check matrix , *LOW density parity check codes , *MATRIX multiplications - Abstract
This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the role that a certain square matrix that appears in the product of the parity-check matrix with its transpose has in the construction of codes with graphs of desired girth and further explore it in order to generate the set of necessary and sufficient conditions for a Tanner graph to have a given girth between 6 and 12. For each such girth, we present algorithms to construct codes of the desired girth and we show how to use them to compute the minimum necessary value of the lifting factor. For girth larger than 12, we show how to use multi-step graph lifting methods to deterministically modify codes in order to increase their girth. We also give a new perspective on LDPC protograph-based parity-check matrices by viewing them as rows of a parity-check matrix equal to the sum of certain permutation matrices and obtain an important connection between all protographs and those with variable nodes of degree 2. We also show that the results and methodology that we develop for the all-one protograph can be used and adapted to analyze the girth of the Tanner graph of any parity-check matrix and demonstrate how this can be done using a well-known irregular, multi-edge protograph specified by the NASA Consultative Committee for Space Data Systems (CCSDS). Throughout the paper, we exemplify our theoretical results with constructions of LDPC codes with Tanner graphs of any girth between 6 and 14 and give sufficient conditions for a multi-step lifted parity-check matrix to have girth between 14 and 22. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Improved Bounds for (b, k)-Hashing.
- Author
-
Della Fiore, Stefano, Costa, Simone, and Dalai, Marco
- Subjects
- *
DISTRIBUTION (Probability theory) , *INFORMATION theory , *COMPUTER science , *QUADRATIC forms - Abstract
For fixed integers $n$ and $b\geq k$ , let $A(b,k,n)$ the largest size of a subset of $\{1,2,\ldots,b\}^{n}$ such that, for any $k$ distinct elements in the set, there is a coordinate where they all differ. Bounding $A(b,k,n)$ is a problem of relevant interest in information theory and computer science, relating to the zero-error capacity with list decoding and to the study of $(b, k)$ -hash families of functions. It is known that, for fixed $b$ and $k$ , $A(b,k,n)$ grows exponentially in $n$. In this paper, we determine new exponential upper bounds for different values of $b$ and $k$. A first bound on $A(b,k,n)$ for general $b$ and $k$ was derived by Fredman and Komlós in the ’80s and improved for certain $b\neq k$ by Körner and Marton and by Arikan. Only very recently better bounds were derived for general $b$ and $k$ by Guruswami and Riazanov, while stronger results for small values of $b=k$ were obtained by Arikan, by Dalai, Guruswami and Radhakrishnan, and by Costa and Dalai. In this paper, we strengthen the bounds for some specific values of $b$ and $k$. Our contribution is a new computational method for obtaining upper bounds on the values of a quadratic form defined over discrete probability distributions in arbitrary dimensions, which emerged as a central ingredient in recent works. The proposed method reduces an infinite-dimensional problem to a finite one, which we manage to further simplify by means of a series of optimality conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. Seismic Bearing Capacity Solution for Strip Footings in Unsaturated Soils with Modified Pseudo-Dynamic Approach.
- Author
-
Xu, Sheng and Zhou, De
- Subjects
- *
BEARING capacity of soils , *SOILS , *VIRTUAL work , *QUADRATIC programming , *ENGINEERING mathematics , *ENERGY dissipation - Abstract
In engineering mathematics, the unsaturated nature of soil has a significant impact on the seismic bearing capacity solution. However, it has generally been neglected in the published literature to date. Based on the kinematic approach of limit analysis, the present study proposes a method for calculating the bearing capacity of shallow strip footings located in unsaturated soils, taking four common types of soils as examples. The modified pseudo-dynamic (MPD) approach is used to calculate the seismic forces varying with time and space, and the layerwise summation method is used to derive the power generated by the seismic forces. In the calculation of internal energy dissipation, this paper introduces the effective stress based on the suction stress to derive the cohesion expression at different depths. The analytical formula of bearing capacity is obtained by the principle of virtual work, and its value is optimized by the Sequential Quadratic Programming (SQP) algorithm. In order to verify the validity of the proposed method, the present results are compared with the solutions published so far and a good agreement is obtained. Finally, a parametric study is performed to investigate the influence of different types of parameters on the bearing capacity. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
11. SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via s+-index.
- Author
-
Zhou, Mingqiang, Zeng, Qianqian, and Guo, Ping
- Subjects
- *
SPARSE graphs , *COMPUTER vision , *NP-hard problems , *HEURISTIC , *ALGORITHMS , *COMPUTATIONAL biology - Abstract
The Maximum Clique Problem (MCP) is a classic NP-hard problem, which has the goal of finding the largest possible clique. It is known to have direct applications in a wide spectrum of fields such as data association problems appearing in bioinformatics and computational biology, computer vision and robotics. Solutions like using brute force, backtracking and branch and bound are designed to deal with the maximum problem. In the branch and bound method, a branch is pruned if the currently found largest clique is better than its upper bound. However, the upper bound obtained by current methods is often not close enough to the ω (G) , leading to large inefficient search space. This paper discusses the branch and bound procedure to solve the maximum clique problem in large and sparse graphs and proposes a new efficient branch and bound maximum clique algorithm named SMC-BRB. SMC-BRB solves the maximum clique problem in heuristic search stage and exact search stage. It simultaneously utilizes the s + -index and color-based upper bound in heuristic search stage, which effectively reduces the number of branches in the exact search stage. This method is beneficial to the solution of MCP because it provides a scale reduction on heuristic search stage. Experimental results show that SMC-BRB has better performance than the state-of-the-art algorithm MC-BRB, which demonstrates the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
12. Fast Generation of RSA Keys Using Smooth Integers.
- Author
-
Dimitrov, Vassil, Vigneri, Luigi, and Attias, Vidal
- Abstract
Primality generation is the cornerstone of several essential cryptographic systems. The problem has been a subject of deep investigations, but there is still a substantial room for improvements. Typically, the algorithms used have two parts – trial divisions aimed at eliminating numbers with small prime factors and primality tests based on an easy-to-compute statement that is valid for primes and invalid for composites. In this paper, we will showcase a technique that will eliminate the first phase of the primality testing algorithms. The computational simulations show a reduction of the primality generation time by about 30 percent in the case of 1024-bit RSA key pairs. This can be particularly beneficial in the case of decentralized environments for shared RSA keys as the initial trial division part of the key generation algorithms can be avoided at no cost. This also significantly reduces the communication complexity. Another essential contribution of the paper is the introduction of a new one-way function that is computationally simpler than the existing ones used in public-key cryptography. This function can be used to create new random number generators, and it also could be potentially used for designing entirely new public-key encryption systems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing.
- Author
-
Beeri, Niv and Schwartz, Moshe
- Subjects
- *
SHOTGUN sequencing , *DNA , *DE Bruijn graph , *ABSOLUTE value - Abstract
A common method for reading information stored in DNA molecules is shotgun sequencing. This method outputs a histogram of the frequencies of all the molecules’ substrings of a given length $\ell $. To protect against noisy readings, the rank-modulation scheme encodes the information in the relative ranking of the substring frequencies, instead of their absolute values. However, the best rank-modulation codes for shotgun sequencing have low rates which are asymptotically vanishing. In this paper we propose new constructions of rank-modulation codes for shotgun sequencing. The first code construction is systematic, allowing the user to arbitrarily set the frequencies of a large subset of the substrings, which the encoder then completes to a permutation that may be realized by a DNA molecule. The construction is then improved by allowing the user to set the frequencies of additional substrings, at the cost of imposing constraints on the frequencies. The resulting codes have higher, non-vanishing rates, compared with previously known codes. As an example, for histograms of substrings of length $\ell =2$ , and an alphabet of size 4 (as in DNA molecules), we are able to construct a code with rate $\approx 0.909$ , whereas previously, the best construction resulted in a code with rate $\approx 0.654$. Additionally, the encoded information in our construction may be written to shorter DNA molecules than possible before. We also prove that the systematic codes constructed in this paper are the largest possible among all systematic codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Coding With Noiseless Feedback Over the Z-Channel.
- Author
-
Deppe, Christian, Lebedev, Vladimir, Maringer, Georg, and Polyanskii, Nikita
- Subjects
- *
ERROR-correcting codes , *BOUND states , *PARALLEL algorithms - Abstract
In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions, which goes to infinity. Without feedback, it is known that the rate of optimal asymmetric-error-correcting codes for the error fraction $\tau \ge 1/4$ vanishes as the blocklength grows. In this paper, we give an efficient feedback encoding scheme with $n$ transmissions that achieves a positive rate for any fraction of errors $\tau < 1$ and $n\to \infty $. Additionally, we state an upper bound on the rate of asymptotically long feedback asymmetric error-correcting codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Downlink SCMA Codebook Design With Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords.
- Author
-
Huang, Chinwei, Su, Borching, Lin, Tingyi, and Huang, Yenming
- Subjects
- *
ERROR rates , *LAGRANGE problem , *ADDITIVE white Gaussian noise channels , *EUCLIDEAN distance , *EXPECTATION-maximization algorithms - Abstract
Sparse code multiple access (SCMA), as a codebook-based non-orthogonal multiple access (NOMA) technique, has received research attention in recent years. The codebook design problem for SCMA has also been studied to some extent since codebook choices are highly related to the system’s error rate performance. In this paper, we approach the SCMA codebook design problem by formulating an optimization problem to maximize the minimum Euclidean distance (MED) of superimposed codewords under power constraints. While SCMA codebooks with a larger MED are expected to obtain a better BER performance, no optimal SCMA codebook in terms of MED maximization, to the authors’ best knowledge, has been reported in the SCMA literature yet. In this paper, a new iterative algorithm based on alternating maximization with exact penalty is proposed for the MED maximization problem. The proposed algorithm, when supplied with appropriate initial points and parameters, achieves a set of codebooks of all users whose MED is larger than any previously reported results. A Lagrange dual problem is derived which provides an upper bound of MED of any set of codebooks. Even though there is still a nonzero gap between the achieved MED and the upper bound given by the dual problem, simulation results demonstrate clear advantages in error rate performances of the proposed set of codebooks over all existing ones not only in AWGN channels but also in some downlink scenarios that fit in 5G/NR applications, making it a good codebook candidate thereof. The proposed set of SCMA codebooks, however, are not shown to outperform existing ones in uplink channels or in the case where non-consecutive OFDMA subcarriers are used. The correctness and accuracy of error curves in the simulation results are further confirmed by the coincidences with the theoretical upper bounds of error rates derived for any given set of codebooks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Analysis and Design of Polar-Coded Modulation.
- Subjects
- *
LOW density parity check codes , *ERROR rates - Abstract
Conventional design methods of polar-coded modulation schemes aim to minimize the block error rate (BLER) under successive cancellation (SC) decoding. However, codes designed by conventional methods are not competitive under successive cancellation list (SCL) decoding. This paper presents a new design method based on the BLER upper bound under maximum-likelihood (ML) decoding (ML-BLER upper bound). The ML-BLER upper bound depends on the weight enumerating function (WEF) of the polar-coded modulation scheme over the squared Euclidean distance. In this paper, the polar-coded modulation is randomized by the concept of interleaved polar (i-polar) codes, and the WEF averaged over the ensemble of the polar-coded modulation schemes can be derived. Three polar-coded modulation schemes are considered, i.e., the bit-interleaved polar-coded modulation with a single interleaver (BIPCM-SI), the bit-interleaved polar-coded modulation with multiple interleavers (BIPCM-MI), and the multi-level polar-coded modulation (MLPCM). A new bit channel selection algorithm for polar-coded modulation schemes is proposed, which takes the polarization effect and the ML-BLER upper bound as design criteria. Design examples show that, under SCL decoding, the polar-coded modulation schemes (without CRC) with the proposed channel selection algorithm outperform those with conventional algorithms and are competitive as compared to the state-of-the-art 5G LDPC codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. A Novel Radio Geometric Mean Algorithm for a Graph.
- Author
-
ELrokh, Ashraf, Al-Shamiri, Mohammed M. Ali, and Abd El-hay, Atef
- Subjects
- *
GRAPH algorithms , *GRAPH labelings , *RADIO antennas , *INJECTIVE functions , *NATURAL numbers , *RADIO waves , *RADIO technology - Abstract
Radio antennas switch signals in the form of radio waves using different frequency bands of the electromagnetic spectrum. To avoid interruption, each radio station is assigned a unique number. The channel assignment problem refers to this application. A radio geometric mean labeling of a connected graph G is an injective function h from the vertex set, V (G) to the set of natural numbers N such that for any two distinct vertices x and y of G , h (x) · h (y) ≥ d i a m + 1 − d (x , y) . The radio geometric mean number of h , r g m n (h) , is the maximum number assigned to any vertex of G. The radio geometric mean number of G, r g m n (G) is the minimum value of r g m n (h) , taken over all radio geometric mean labeling h of G . In this paper, we present two theorems for calculating the exact radio geometric mean number of paths and cycles. We also present a novel algorithm for determining the upper bound for the radio geometric mean number of a given graph. We verify that the upper bounds obtained from this algorithm coincide with the exact value of the radio geometric mean number for paths, cycles, stars, and bi-stars. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
18. Uncertain Disturbance Rejection and Attenuation for Semi-Markov Jump Systems With Application to 2-Degree-Freedom Robot Arm.
- Author
-
Yao, Xiuming, Zhang, Lingling, and Zheng, Wei Xing
- Subjects
- *
MARKOVIAN jump linear systems , *JUMP processes , *ROBOTS , *UNCERTAIN systems , *HARMONIC analysis (Mathematics) - Abstract
This paper studies the composite refined anti-disturbance control problem of a 2-degree-of-freedom robot arm system modeled by a semi-Markov jump system with multiple disturbances, which includes harmonic disturbances with unknown frequency and amplitude as well as energy bounded disturbances. Firstly, the semi-Markov jump system model is proposed to construct a novel linear model of the 2-degree-of-freedom robot arm subject to two types of disturbances. Next, in order to estimate the uncertain harmonic disturbance, a novel higher order disturbance observer is introduced to convert the uncertain harmonic disturbance into some parameter uncertainty and then estimate the parameter uncertainty. In addition, a corresponding composite anti-disturbance control scheme is formulated to reject and attenuate the above two types of disturbances, respectively. Furthermore, sufficient conditions that can guarantee that the system is stochastically stable are given. Finally, a simulation study of the obtained model is carried out to illustrate the validity of the composite control design method proposed in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
19. Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions.
- Subjects
- *
SET functions , *HAMMING weight , *UNIFORMITY - Abstract
We revisit and take a closer look at a (not so well known) result of a 2017 paper, showing that the differential uniformity of any vectorial function is bounded from below by an expression depending on the size of its image set. We make explicit the resulting tight lower bound on the image set size of differentially $\delta $ -uniform functions (which is the only currently known non-trivial lower bound on the image set size of such functions). We also significantly improve an upper bound on the nonlinearity of vectorial functions obtained in the same reference and involving their image set size. We study when the resulting bound is sharper than the covering radius bound. We obtain as a by-product a lower bound on the Hamming distance between differentially $\delta $ -uniform functions and affine functions, which we improve significantly with a second bound. This leads us to study what can be the maximum Hamming distance between vectorial functions and affine functions. We provide an upper bound which is slightly sharper than a bound by Liu, Mesnager and Chen when $m < n$ , and a second upper bound, which is much stronger in the case (happening in practice) where $m$ is near $n$ ; we study the tightness of this latter bound; this leads to an interesting question on APN functions, which we address (negatively). We finally derive an upper bound on the nonlinearity of vectorial functions by means of their Hamming distance to affine functions and make more precise the bound on the differential uniformity which was the starting point of the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
20. Criss-Cross Insertion and Deletion Correcting Codes.
- Author
-
Bitar, Rawad, Welter, Lorenz, Smagloy, Ilia, Wachter-Zeh, Antonia, and Yaakobi, Eitan
- Subjects
- *
DECODING algorithms , *HUFFMAN codes , *ERROR-correcting codes , *ENCODING - Abstract
This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an $n \times n$ array can experience deletions of rows and columns. These deletion errors are referred to as $({t_{\mathrm {r}}}, {t_{\mathrm {c}}})$ -criss-cross deletions if ${t_{\mathrm {r}}}$ rows and ${t_{\mathrm {c}}}$ columns are deleted, while a code correcting these deletion patterns is called a $({t_{\mathrm {r}}}, {t_{\mathrm {c}}})$ -criss-cross deletion correction code. The definitions for criss-cross insertions are similar. It is first shown that when $t_{r}=t_{c}$ the problems of correcting criss-cross deletions and criss-cross insertions are equivalent. The focus of this paper lies on the case of (1, 1)-criss-cross deletions. A non-asymptotic upper bound on the cardinality of (1, 1)-criss-cross deletion correction codes is shown which assures that the redundancy is at least $2n-3+2\log n$ bits. A code construction with an existential encoding and an explicit decoding algorithm is presented. The redundancy of the construction is at most $2n+4 \log n + 7 +2 \log e$. A construction with explicit encoder and decoder is presented. The explicit encoder adds an extra $5\log n + 5$ bits of redundancy to the construction. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
21. On the Success Probability of Three Detectors for the Box-Constrained Integer Linear Model.
- Author
-
Wen, Jinming and Chang, Xiao-Wen
- Subjects
- *
DETECTORS , *GAUSSIAN distribution , *INTEGERS , *MAXIMUM likelihood detection , *LEAST squares , *PROBABILITY theory , *GLOBAL Positioning System - Abstract
This paper is concerned with detecting an integer parameter vector inside a box from a linear model that is corrupted with a noise vector following the Gaussian distribution. One of the commonly used detectors is the maximum likelihood detector, which is obtained by solving a box-constrained integer least squares problem, that is NP-hard. Two other popular detectors are the box-constrained rounding and Babai detectors due to their high efficiency of implementation. In this paper, we first present formulas for the success probabilities (the probabilities of correct detection) of these three detectors for two different situations: the integer parameter vector is deterministic and is uniformly distributed over the constraint box. Then, we give two simple examples to respectively show that the success probability of the box-constrained rounding detector can be larger than that of the box-constrained Babai detector and the latter can be larger than the success probability of the maximum likelihood detector when the parameter vector is deterministic, and prove that the success probability of the box-constrained rounding detector is always not larger than that of the box-constrained Babai detector when the parameter vector is uniformly distributed over the constraint box. Some relations between the results for the box constrained and ordinary cases are presented, and two bounds on the success probability of the maximum likelihood detector, which can easily be computed, are developed. Finally, simulation results are provided to illustrate our main theoretical findings. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
22. On Correlation Immune Boolean Functions With Minimum Hamming Weight Power of 2.
- Author
-
Mesnager, Sihem and Su, Sihong
- Subjects
- *
BOOLEAN functions , *HAMMING weight , *STREAM ciphers , *STATISTICAL correlation , *COMBINATORICS , *CRYPTOGRAPHY - Abstract
The notion of correlation immune functions has been introduced by Siegenthaler (1984) in symmetric cryptography in the framework of stream ciphers. At the conference CRYPTO’91 by Camion et al., it has been pointed out that this notion existed in statistics and combinatorics. It has recently been highlighted that such functions also play an important role in a new framework related to side-channel attack counter-measures. Since then, the interest in correlation immune Boolean functions has been renewed, and new challenges regarding these functions have appeared. Specifically, low Hamming weight correlation immune functions have been selected as useful for counter-measures to side-channel attacks. Despite their importance, the literature is not abundant in this research direction. Two very interesting articles in which such correlation immune functions were nicely explored, given this novel use of them. Carlet initiated the first one in 2013, and the second one is due to Carlet and Chen (2018). This paper deals with correlation immune Boolean functions aiming to produce more candidates of those processing low Hamming weights. We shall focus on correlation immune Boolean functions with Hamming weights power of 2 (which offer a flexibility to control the correlation immunity aspects) and present several methods of designing them. Some design methods are efficient and could be employed to derive such functions. Consequently, given two positive integers $n$ and $m$ , we derive new effective constructions of correlation immune Boolean functions with Hamming weight power of 2. Furthermore, an upper bound on the correlation immunity of the newly constructed $n$ -variable Boolean functions with Hamming weight $2^{m}$ was determined for $n-m\ge 0$. Besides, exact values and lower bounds on the maximum correlation immunity of those functions are explored and discussed, mainly when the values of $n$ and $m$ are very close. This paper also exhibits explicit examples of those correlation immune functions that illustrate our methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
23. New upper bounds for the dominant eigenvalue of a matrix with Perron–Frobenius property.
- Author
-
He, Jun, Liu, Yanmin, and Lv, Wei
- Subjects
- *
EIGENVALUES , *NONNEGATIVE matrices , *MATRICES (Mathematics) , *MATHEMATICAL bounds - Abstract
In this paper, we derive some upper bounds for the dominant eigenvalue of a matrix with some negative entries, which possess the Perron–Frobenius property. Numerical examples are given to illustrate the effectiveness of our new upper bounds. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
24. List Decoding Random Euclidean Codes and Infinite Constellations.
- Author
-
Zhang, Yihan and Vatedka, Shashank
- Subjects
- *
ANALYTIC number theory , *GAUSSIAN channels , *LINEAR codes , *CHANNEL coding , *SAMPLING errors - Abstract
We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $P $ and $N $ respectively, the list decoding capacity is equal to $\frac {1}{2}\log \frac {P}{N}$. Random spherical codes achieve constant list sizes, and the goal of the present paper is to obtain a better understanding of the smallest achievable list size as a function of the gap to capacity. We show a reduction from arbitrary codes to spherical codes, and derive a lower bound on the list size of typical random spherical codes. We also give an upper bound on the list size achievable using nested Construction-A lattices and infinite Construction-A lattices. We then define and study a class of infinite constellations that generalize Construction-A lattices and prove upper and lower bounds for the same. Other goodness properties such as packing goodness and AWGN goodness of infinite constellations are proved along the way. Finally, we consider random lattices sampled from the Haar distribution and show that if a certain conjecture that originates in analytic number theory is true, then the list size grows as a polynomial function of the gap-to-capacity. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. Some elementary properties of Laurent phenomenon algebras.
- Author
-
Du, Qiuning and Li, Fang
- Abstract
Let Σ be a Laurent phenomenon (LP) seed of rank n , A (Σ) , U (Σ) , and L (Σ) be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each seed of A (Σ) is uniquely defined by its cluster and any two seeds of A (Σ) with n − 1 common cluster variables are connected with each other by one step of mutation. The method in this paper also works for (totally sign-skew-symmetric) cluster algebras. Moreover, we show that U (Σ) is invariant under seed mutations when each exchange polynomials coincides with its exchange Laurent polynomials of Σ. Besides, we obtain the standard monomial bases of L (Σ). We also prove that U (Σ) coincides with L (Σ) under certain conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Learning With Multiclass AUC: Theory and Algorithms.
- Author
-
Yang, Zhiyong, Xu, Qianqian, Bao, Shilong, Cao, Xiaochun, and Huang, Qingming
- Subjects
- *
RECOMMENDER systems , *MACHINE learning , *ALGORITHMS , *SCALABILITY , *STOCHASTIC processes - Abstract
The Area under the ROC curve (AUC) is a well-known ranking metric for problems such as imbalanced learning and recommender systems. The vast majority of existing AUC-optimization-based machine learning methods only focus on binary-class cases, while leaving the multiclass cases unconsidered. In this paper, we start an early trial to consider the problem of learning multiclass scoring functions via optimizing multiclass AUC metrics. Our foundation is based on the M metric, which is a well-known multiclass extension of AUC. We first pay a revisit to this metric, showing that it could eliminate the imbalance issue from the minority class pairs. Motivated by this, we propose an empirical surrogate risk minimization framework to approximately optimize the M metric. Theoretically, we show that: (i) optimizing most of the popular differentiable surrogate losses suffices to reach the Bayes optimal scoring function asymptotically; (ii) the training framework enjoys an imbalance-aware generalization error bound, which pays more attention to the bottleneck samples of minority classes compared with the traditional $O(\sqrt{1/N})$ O (1 / N) result. Practically, to deal with the low scalability of the computational operations, we propose acceleration methods for three popular surrogate loss functions, including the exponential loss, squared loss, and hinge loss, to speed up loss and gradient evaluations. Finally, experimental results on 11 real-world datasets demonstrate the effectiveness of our proposed framework. The code is now available at https://github.com/joshuaas/Learning-with-Multiclass-AUC-Theory-and-Algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
27. Capacity Bounds for One-Bit MIMO Gaussian Channels With Analog Combining.
- Author
-
Bernardo, Neil Irwin, Zhu, Jingge, Eldar, Yonina C., and Evans, Jamie
- Subjects
- *
GAUSSIAN channels , *ANALOG-to-digital converters , *SIGNAL-to-noise ratio , *ANTENNAS (Electronics) , *RECEIVING antennas - Abstract
The use of 1-bit analog-to-digital converters (ADCs) is seen as a promising approach to significantly reduce the power consumption and hardware cost of multiple-input multiple-output (MIMO) receivers. However, the nonlinear distortion due to 1-bit quantization fundamentally changes the optimal communication strategy and also imposes a capacity penalty to the system. In this paper, the capacity of a Gaussian MIMO channel in which the antenna outputs are processed by an analog linear combiner and then quantized by a set of zero threshold ADCs is studied. A new capacity upper bound for the zero threshold case is established that is tighter than the bounds available in the literature. In addition, we propose an achievability scheme which configures the analog combiner to create parallel Gaussian channels with phase quantization at the output. Under this class of analog combiners, an algorithm is presented that identifies the analog combiner and input distribution that maximize the achievable rate. Numerical results are provided showing that the rate of the achievability scheme is tight in the low signal-to-noise ratio (SNR) regime. Finally, a new 1-bit MIMO receiver architecture which employs analog temporal and spatial processing is proposed. The proposed receiver attains the capacity in the high SNR regime. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks.
- Author
-
Domanovitz, Elad, Khisti, Ashish, Tan, Wai-Tian, Zhu, Xiaoqing, and Apostolopoulos, John
- Subjects
- *
LINEAR network coding , *FORWARD error correction , *RATE setting - Abstract
This paper studies low-latency streaming codes for the multi-hop network. The source transmits a sequence of messages to a destination through a chain of relays, and requires the destination to reconstruct each message by its deadline. We assume that each communication link is subjected to a certain maximum number of packet erasures. The case of a single relay (a three-node network) was considered in Fong et al. (2020). A coding scheme known as symbol-wise decode and forward was proposed. In the present work, we propose an alternative scheme that is different from Fong et al. (2020) and still achieves the same rate as in Fong et al. (2020) for the one hop case as the field-size goes to infinity. Furthermore, our proposed scheme naturally generalizes to the case of multiple-relay nodes yielding new achievable rates for this setting. The main difference with Fong et al. (2020) is that our proposed scheme exploits the ability of the relay nodes to adapt the transmission based on the erasures on the previous link. Hence, we refer to our scheme as “state-dependent” and contrast it with the scheme in Fong et al. (2020) that is state-independent. Our scheme requires the relay nodes to append a header to the transmitted packets, and we show that the size of the header does not depend on the field-size of the code. We also derive an upper bound on the maximal streaming rate achievable over a network with an arbitrary number of relays. We show that this upper bound matches our achievable rate in the special case when the maximal number of erasures on the first link is greater than or equal to the maximal number of erasures on each of the following links, and the field size goes to infinity. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. Topological Interference Management With Confidential Messages.
- Author
-
de Dieu Mutangana, Jean and Tandon, Ravi
- Subjects
- *
DEGREES of freedom , *INDEPENDENT sets , *ELECTRIC network topology , *TRANSMITTERS (Communication) , *TOPOLOGY - Abstract
The topological interference management (TIM) problem refers to the study of the $K$ -user partially connected interference networks with no channel state information at the transmitters (CSIT), except for the knowledge of network topology. In this paper, we study the TIM problem with confidential messages (TIM-CM), where message confidentiality must be satisfied in addition to reliability constraints. In particular, each transmitted message must be decodable at its intended receiver and remain confidential at the remaining $(K-1)$ receivers. Our main contribution is to present a comprehensive set of results for the TIM-CM problem by studying the symmetric secure degrees of freedom (SDoF). To this end, we first characterize necessary and sufficient conditions for feasibility of positive symmetric SDoF for any arbitrary topology. We next present two achievable schemes for the TIM-CM problem: For the first scheme, we use the concept of secure partition and, for the second one, we use the concept of secure independent sets. We also present outer bounds on symmetric SDoF for any arbitrary network topology. Using these bounds, we characterize the optimal symmetric SDoF of all $K=2$ -user and $K=3$ -user network topologies. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Secret Key-Enabled Authenticated-Capacity Region, Part—II: Typical-Authentication.
- Author
-
Graves, Eric, Perazzone, Jake B., Yu, Paul L., and Blum, Rick S.
- Subjects
- *
GAUSSIAN channels , *DECODERS & decoding , *MULTIUSER channels - Abstract
This paper investigates the secret key-authenticated-capacity region, where information-theoretic authentication is defined by the ability of the decoder to accept and decode messages originating from a valid encoder while rejecting messages from other invalid sources. The model considered here consists of a valid encoder-decoder pairing that can communicate through a channel controlled by an adversary who is also able to eavesdrop on the encoder’s transmissions. Prior to the encoder’s transmission, the adversary decides whether or not to replace the decoder’s observation with an arbitrary one of the adversary’s choosing, with the adversary’s objective being to have the decoder accept and decode their observation to a valid message (different from that of the encoder). To combat the adversary, the encoder and decoder share a secret key. The secret key-authenticated-capacity region is defined as the region of jointly achievable message rate, authentication rate (a to be defined per symbol measure that will generally represent the likelihood that an adversary can fool the decoder), and the key-consumption rate (how many bits of secret key are needed per symbol sent). This is the second of a two-part study, with the parts differing in their measure of the authentication rate. For this second study, the probability of false authentication is considered as a function of the system state, where the system state is defined by the message being transmitted, the value of the secret key, the adversary’s channel observations, and the adversary’s (possibly stochastic) choice for the decoder’s observation. Termed the typical-authentication rate, the authentication measure considered here corresponds to an upper bound on the probability of false authentication for the majority of system states. For this measure, we derive matching inner and outer bounds for the secret key-enabled authenticated capacity region in terms of traditional information-theoretic measures. In doing so, it is shown that the typical-authentication rate and the message rate exhibit a one-to-one trade-off in the capacity region. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Performance Analysis of IOS-Assisted NOMA System With Channel Correlation and Phase Errors.
- Author
-
Wang, Tianxiong, Badiu, Mihai-Alin, Chen, Gaojie, and Coon, Justin P.
- Subjects
- *
CHANNEL estimation , *ARRAY processing , *RANDOM variables , *SIGNAL processing - Abstract
In this paper, we investigate the performance of an intelligent omni-surface (IOS) assisted downlink non-orthogonal multiple access (NOMA) network with phase quantization errors and channel estimation errors, where the channels related to the IOS are spatially correlated. First, upper bounds on the average achievable rates of the two users are derived. Then, channel hardening is shown to occur in the proposed system, based on which we derive approximations of the average achievable rates of the two users. The analytical results illustrate that the proposed upper bound and approximation on the average achievable rates are asymptotically equivalent in the number of elements. Furthermore, it is proved that the asymptotic equivalence also holds for the average achievable rates with correlated and uncorrelated channels. Additionally, we extend the analysis by evaluating the average achievable rates for IOS assisted orthogonal multiple access (OMA) and IOS assisted multi-user NOMA scenarios. Simulation results corroborate the theoretical analysis and demonstrate that: i) low-precision elements with only two-bit phase adjustment can achieve the performance close to the ideal continuous phase shifting scheme; ii) The average achievable rates with correlated channels and uncorrelated channels are asymptotically equivalent in the number of elements; iii) IOS-assisted NOMA does not always perform better than OMA due to the reconfigurability of IOS in different time slots. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. Performance Bounds of Coded Slotted ALOHA Over Erasure Channels.
- Author
-
Zhang, Zhijun, Niu, Kai, and Dai, Jincheng
- Subjects
- *
GAUSSIAN elimination , *SEARCH algorithms , *LINEAR equations , *ITERATIVE decoding , *DECODING algorithms , *WIRELESS communications - Abstract
In this paper, we derive an upper bound on load-threshold of coded slotted ALOHA (CSA) for slot erasure channel (SEC) and that for packet erasure channel (PEC), respectively. In SEC, by exploiting the analogy between Gaussian elimination of solving linear equations and the iterative successive interference-cancellation (SIC) decoding procedure of CSA, we derive the upper performance bound for SEC. Subsequently, in PEC, utilizing density evolution to track the average probability of packet-decoded failure within the SIC decoding process, we obtain the upper bound for PEC. Moreover, we propose a numerical search algorithm of these bounds under a given calculating precision. The numerical results indicate that the asymptotic upper limit on load-threshold of CSA over SEC is always less than that over PEC with any given erasure probability and average transmission rate. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
33. Asymptotic Divergences and Strong Dichotomy.
- Author
-
Huang, Xiang, Lutz, Jack H., Mayordomo, Elvira, and Stull, Donald M.
- Subjects
- *
KOLMOGOROV complexity , *DIVERGENCE theorem , *SUFFIXES & prefixes (Grammar) , *GAMBLERS , *RANDOM variables , *PROBABILITY measures - Abstract
The Schnorr-Stimm dichotomy theorem (Schnorr and Stimm, 1972) concerns finite-state gamblers that bet on infinite sequences of symbols taken from a finite alphabet $\Sigma $. The theorem asserts that, for any such sequence $S$ , the following two things are true. (1) If $S$ is not normal in the sense of Borel (meaning that every two strings of equal length appear with equal asymptotic frequency in $S$), then there is a finite-state gambler that wins money at an infinitely-often exponential rate betting on $S$. (2) If $S$ is normal, then any finite-state gambler loses money at an exponential rate betting on $S$. In this paper we use the Kullback-Leibler divergence to formulate the lower asymptotic divergence ${\mathrm {div}}(S||\alpha)$ of a probability measure $\alpha $ on $\Sigma $ from a sequence $S$ over $\Sigma $ and the upper asymptotic divergence ${\mathrm {Div}}(S||\alpha)$ of $\alpha $ from $S$ in such a way that a sequence $S$ is $\alpha $ -normal (meaning that every string $w$ has asymptotic frequency $\alpha (w)$ in $S$) if and only if ${\mathrm {Div}}(S||\alpha)=0$. We also use the Kullback-Leibler divergence to quantify the total risk ${\mathrm {Risk}}_{G}(w)$ that a finite-state gambler $G$ takes when betting along a prefix $w$ of $S$. Our main theorem is a strong dichotomy theorem that uses the above notions to quantify the exponential rates of winning and losing on the two sides of the Schnorr-Stimm dichotomy theorem (with the latter routinely extended from normality to $\alpha $ -normality). Modulo asymptotic caveats in the paper, our strong dichotomy theorem says that the following two things hold for prefixes $w$ of $S$. ($1~'$) The infinitely-often exponential rate of winning in 1 is $2^{{\mathrm {Div}}(S||\alpha)|w|}$. ($2~'$) The exponential rate of loss in 2 is $2^{- {\mathrm {Risk}}_{G}(w)}$. We also use (1 $'$) to show that $1- {\mathrm {Div}}(S||\alpha)/c$ , where $c= \log (1/ \min _{a\in \Sigma }\alpha (a))$ , is an upper bound on the finite-state $\alpha $ -dimension of $S$ and prove the dual fact that $1- {\mathrm {div}}(S||\alpha)/c$ is an upper bound on the finite-state strong $\alpha $ -dimension of $S$. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
34. On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes.
- Author
-
Gan, Chunyu, Li, Chengju, Mesnager, Sihem, and Qian, Haifeng
- Subjects
- *
ORTHOGONALIZATION , *FINITE fields , *LINEAR codes , *LIQUID crystal displays - Abstract
Self-orthogonal codes are an important type of linear codes due to their wide applications in communication and cryptography. The Euclidean (or Hermitian) hull of a linear code is defined to be the intersection of the code and its Euclidean (or Hermitian) dual. It is clear that the hull is self-orthogonal. The main goal of this paper is to obtain self-orthogonal codes by investigating the hulls. Let $\mathcal {C}_{(r,r^{m}-1,\delta,b)}$ be the primitive BCH code over $\mathbb {F}_{r}$ of length $r^{m}-1$ with designed distance $\delta $ , where $\mathbb {F}_{r}$ is the finite field of order $r$. In this paper, we will present Euclidean (or Hermitian) self-orthogonal codes and determine their parameters by investigating the Euclidean (or Hermitian) hulls of some primitive BCH codes. Several sufficient and necessary conditions for primitive BCH codes with large Hermitian hulls are developed by presenting lower and upper bounds on their designed distances. Furthermore, some Hermitian self-orthogonal codes are proposed via the hulls of BCH codes and their parameters are also investigated. In addition, we determine the dimensions of the code $\mathcal {C}_{(r,r^{2}-1,\delta,1)}$ and its hull in both Hermitian and Euclidean cases for $2 \le \delta \le r^{2}-1$. We also present two sufficient and necessary conditions on designed distances such that the hull has the largest dimension. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
35. Fundamental Properties of Sum-Rank-Metric Codes.
- Author
-
Byrne, Eimear, Gluesing-Luerssen, Heide, and Ravagnani, Alberto
- Subjects
- *
BLOCK codes , *DUALITY theory (Mathematics) , *CODING theory , *REED-Solomon codes , *LINEAR network coding - Abstract
This paper investigates the theory of sum-rank-metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory of sum-rank-metric codes is also explored, showing that MSRD codes (the sum-rank analogue of MDS codes) dualize to MSRD codes only if all matrix blocks have the same number of columns. In the latter case, duality considerations lead to an upper bound on the number of blocks for MSRD codes. The paper also contains various constructions of sum-rank-metric codes for variable block sizes, illustrating the possible behaviours of these objects with respect to bounds, existence, and duality properties. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
36. Dynamic Quantization Driven Synchronization of Networked Systems Under Event-Triggered Mechanism.
- Author
-
Li, Lulu, Sun, Yifan, Lu, Jianquan, and Cao, Jinde
- Subjects
- *
SYNCHRONIZATION , *INFORMATION sharing , *INFORMATION resources management - Abstract
This paper focuses on the synchronization control issue of networked systems. Due to the imperfect network environment, continuous or precise transmission is impractical, and intermittent communication scheme under state quantization needs to be considered. First, an easy-to-implement dynamic quantizer, which possesses finite quantization level, is designed to deal with the imprecise information sharing. Next, based on the designed quantizer, a dynamic estimator is introduced to estimate the real-time state information and generate control inputs. An event-based communication scheme is utilized to ensure that the estimate error does not exceed a certain threshold. Then, detailed design of the dynamically quantized controller is given to achieve exact synchronization, and corresponding distributed design is also provided to improve the feasibility. Moreover, some results for practical synchronization are derived. Finally, the validity of our theoretical results is illustrated by two numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. Impact of Action-Dependent State and Channel Feedback on Gaussian Wiretap Channels.
- Author
-
Dai, Bin, Li, Chong, Liang, Yingbin, Ma, Zheng, and Shamai Shitz, Shlomo
- Subjects
- *
GAUSSIAN channels , *SECRECY , *TRANSMITTERS (Communication) - Abstract
We investigate the state-dependent Gaussian wiretap channel with noncausal channel state information at the transmitter (GWTC-N-CSIT), and explore whether three strategies (i.e., taking action on the state, legitimate receiver’s channel output feedback, and combining the former two strategies together) help to enhance the secrecy capacity of the GWTC-N-CSIT. To be specific, we first determine the secrecy capacity of the GWTC-N-CSIT with noiseless feedback. Next, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with action-dependent state. Finally, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with both action-dependent state and noiseless feedback, and show that these bounds meet for a special case. Numerical results of this paper indicate that all three strategies enhance the secrecy capacity of the GWTC-N-CSIT. The study of this paper offers new options for enhancing the secrecy rates of the state-dependent wiretap channel models. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
38. Geometric Approach to b-Symbol Hamming Weights of Cyclic Codes.
- Author
-
Shi, Minjia, Ozbudak, Ferruh, and Sole, Patrick
- Subjects
- *
CYCLIC codes , *HAMMING weight , *GEOMETRIC approach , *FINITE fields , *BINARY codes , *DECODING algorithms , *HAMMING distance , *ALGEBRAIC curves - Abstract
Symbol-pair codes were introduced by Cassuto and Blaum in 2010 to protect pair errors in symbol-pair read channels. Recently Yaakobi, Bruck and Siegel (2016) generalized this notion to b-symbol codes in order to consider consecutive b errors for a prescribed integer b ≥ 2, and they gave constructions and decoding algorithms. Cyclic codes were considered by various authors as candidates for symbol-pair codes and they established minimum distance bounds on (certain) cyclic codes. In this paper we use algebraic curves over finite fields in order to obtain tight lower and upper bounds on b-symbol Hamming weights of arbitrary cyclic codes over Fq. Here b ≥ 2 is an arbitrary prescribed positive integer and Fq is an arbitrary finite field. We also present a stability theorem for an arbitrary cyclic code C of dimension k and length n: the b-symbol Hamming weight enumerator of C is the same as the k-symbol Hamming weight enumerator of C if k ≤ b ≤ n−1. Moreover, we give improved tight lower and upper bounds on b-symbol Hamming weights of some cyclic codes related to irreducible cyclic codes. Throughout the paper the length n is coprime to q. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
39. Error Bounds of Imitating Policies and Environments for Reinforcement Learning.
- Author
-
Xu, Tian, Li, Ziniu, and Yu, Yang
- Subjects
- *
REINFORCEMENT learning , *CLASSROOM environment - Abstract
In sequential decision-making, imitation learning (IL) trains a policy efficiently by mimicking expert demonstrations. Various imitation methods were proposed and empirically evaluated, meanwhile, their theoretical understandings need further studies, among which the compounding error in long-horizon decisions is a major issue. In this paper, we first analyze the value gap between the expert policy and imitated policies by two imitation methods, behavioral cloning (BC) and generative adversarial imitation. The results support that generative adversarial imitation can reduce the compounding error compared to BC. Furthermore, we establish the lower bounds of IL under two settings, suggesting the significance of environment interactions in IL. By considering the environment transition model as a dual agent, IL can also be used to learn the environment model. Therefore, based on the bounds of imitating policies, we further analyze the performance of imitating environments. The results show that environment models can be more effectively imitated by generative adversarial imitation than BC. Particularly, we obtain a policy evaluation error that is linear with the effective planning horizon w.r.t. the model bias, suggesting a novel application of adversarial imitation for model-based reinforcement learning (MBRL). We hope these results could inspire future advances in IL and MBRL. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
40. On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms.
- Author
-
Gu, Yujie, Akao, Sonata, Esfahani, Navid Nasr, Miao, Ying, and Sakurai, Kouichi
- Subjects
- *
INFORMATION-theoretic security , *DISTRIBUTION (Probability theory) , *INFORMATION technology security , *RANDOM variables - Abstract
All-or-nothing transforms (AONTs) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditionally secure AONTs and their combinatorial characterization were introduced by Stinson. Informally, a combinatorial AONT is an array with the unbiased requirements and its security properties in general depend on the prior probability distribution on the inputs $s$ -tuples. Recently, it was shown by Esfahani and Stinson that a combinatorial AONT has perfect security provided that all the inputs $s$ -tuples are equiprobable, and has weak security provided that all the inputs $s$ -tuples are with non-zero probability. This paper aims to explore on the gap between perfect security and weak security for combinatorial $(t,s,v)$ -AONTs. Concretely, we consider the typical scenario that all the $s$ inputs take values independently (but not necessarily identically) and quantify the amount of information $H(\mathcal {X}|\mathcal {Y})$ about any $t$ inputs $\mathcal {X}$ that is not revealed by any $s-t$ outputs $\mathcal {Y}$. In particular, we establish the general lower and upper bounds on $H(\mathcal {X}|\mathcal {Y})$ for combinatorial AONTs using information-theoretic techniques, and also show that the derived bounds can be attained in certain cases. Furthermore, the discussions are extended for the security properties of combinatorial asymmetric AONTs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. Finite-Time and Fixed-Time Synchronization of Coupled Switched Neural Networks Subject to Stochastic Disturbances.
- Author
-
Guo, Zhenyuan, Xie, Hui, and Wang, Jun
- Subjects
- *
NEURAL circuitry , *SYNCHRONIZATION , *DYNAMICAL systems - Abstract
In this paper, we address the finite-time and fixed-time synchronization of a general class of switched neural networks (SNNs) with time delays subject to stochastic disturbances. Considering two types of switching in this class of SNNs: 1) intra-SNN state-dependent switching and 2) inter-SNN Markovian switching, we develop three control laws and derive three sets of sufficient conditions for both finite-time and fixed-time synchronization of SNNs subject to stochastic disturbances. We make two remarks on the effects of control-law parameters on synchronization settling time. Moreover, we derive several upper bounds of synchronization settling time and evaluate their pros and cons. Finally, we elaborate on two numerical examples to illustrate the viability of the theoretical results. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
42. Comments on “Adaptive Sliding Mode Control for Attitude Stabilization With Actuator Saturation”.
- Subjects
- *
SLIDING mode control , *ACTUATORS - Abstract
In this letter (Zhu et al. 2011), an adaptive sliding mode controller is proposed for attitude stabilization of spacecraft under inertia uncertainty, external disturbances, and actuator constraints. Some comments on this issue are made here to point out a serious mistake and the untenable main result in the paper. A correction is proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. Enumerating Maximum Cliques in Massive Graphs.
- Author
-
Lu, Can, Yu, Jeffrey Xu, Wei, Hao, and Zhang, Yikai
- Subjects
- *
NP-hard problems , *ANOMALY detection (Computer security) , *SOCIAL networks , *CHARTS, diagrams, etc. , *UNDIRECTED graphs , *GENE expression , *APPROXIMATION algorithms - Abstract
Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NP-hard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in social networks and social media, team formation in expert networks, gene expression and motif discovery in bioinformatics and anomaly detection in complex networks, revealing the structure and function of networks. However, algorithms designed for the maximum clique problem are expensive to deal with real-world networks. In this paper, we first devise a randomized algorithm for the maximum clique problem. Different from previous algorithms that search from each vertex one after another, our approach RMC, for the randomized maximum clique problem, employs a binary search while maintaining a lower bound $\underline{\omega _c}$ ω c ̲ and an upper bound $\overline{\omega _c}$ ω c ¯ of $\omega (G)$ ω (G) . In each iteration, RMC attempts to find a $\omega _t$ ω t -clique where $\omega _t=\lfloor (\underline{\omega _c}+\overline{\omega _c})/2\rfloor$ ω t = ⌊ (ω c ̲ + ω c ¯) / 2 ⌋ . As finding $\omega _t$ ω t in each iteration is NP-complete, we extract a seed set $S$ S such that the problem of finding a $\omega _t$ ω t -clique in $G$ G is equivalent to finding a $\omega _t$ ω t -clique in $S$ S with probability guarantees ($\geq$ ≥ $ 1-n^{-c}$ 1 - n - c ). We propose a novel iterative algorithm to determine the maximum clique by searching a $k$ k -clique in $S$ S starting from $k=\underline{\omega _c}+1$ k = ω c ̲ + 1 until $S$ S becomes $\lbrace \rbrace$ { } , when more iterations benefit marginally. Due to the potential inconsistency of maximum clique algorithms, we study the problem of maximum clique enumeration and propose an efficient algorithm RMCE to enumerate all maximum cliques in a given graph. As confirmed by the experiments, both RMC and RMCE are much more efficient and robust than previous solutions, RMC can always find the exact maximum clique, and RMCE can always enumerate all maximum cliques in a given graph. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
44. Proof of Mirror Theory for ξ max = 2.
- Author
-
Dutta, Avijit, Nandi, Mridul, and Saha, Abishanka
- Subjects
- *
PROOF theory , *BLOCK ciphers , *RADIO frequency - Abstract
In ICISC-05, and in the ePrint 2010/287, Patarin claimed a lower bound on the number of $2 q$ tuples of $n$ -bit strings $(P_{1}, \ldots, P_{2q}) \in ({\{0,1\}}^{n})^{2q}$ satisfying $P_{2i - 1} \oplus P_{2i} = \lambda _{i}$ for $1 \leq i \leq q$ such that $P_{1}, P_{2}, \ldots $ , $P_{2q}$ are distinct and $\lambda _{i} \in {\{0,1\}} ^{n} \setminus \{0^{n}\}$. This result is known as Mirror theory and widely used in cryptography. It stands as a powerful tool to provide a high-security guarantee for many block cipher-(or even ideal permutation-) based designs. In particular, Mirror theory has a direct application in the security of XOR of block ciphers. Unfortunately, the proof of Mirror theory contains some unverifiable gaps and several mistakes. This paper provides a simple and verifiable proof of Mirror theory. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
45. Streaming Codes for Variable-Size Messages.
- Author
-
Rudow, Michael and Rashmi, K. V.
- Subjects
- *
BLOCK codes , *VIDEOCONFERENCING , *STREAMING media - Abstract
Live communication is ubiquitous, and frequently must contend with reliability issues due to packet loss during transmission. The effect of packet losses can be alleviated by using erasure codes, which aid in recovering lost packets. Streaming codes are a class of codes designed for the live communication setting, which encode a stream of message packets arriving sequentially for transmission over a packet-loss channel. The existing study of streaming codes considers settings where the sizes of the message packets to be transmitted are all fixed. However, message packets occur with unpredictable and variable sizes in many applications, such as videoconferencing. In this paper, we present a generalized model for streaming codes that incorporates message packets of variable sizes. We show that the variability in the sizes of message packets induces a new trade-off between the rate and the decoding delay under lossless transmission. Moreover, the variability in the sizes of message packets impacts the optimal rate of transmission. To address this, we introduce algorithms to compute upper and lower bounds on the optimal rate for any given sequence of sizes of message packets. We then design an explicit streaming code for the proposed model. We empirically evaluate the code construction over a live video trace for several representative parameter settings, and show that the rate of the construction is approximately 90% of an upper bound and 5%–48% higher than naively using the existing streaming codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
46. A Practical $O(N^2)$ O ( N 2 ) Outlier Removal Method for Correspondence-Based Point Cloud Registration.
- Subjects
- *
POINT cloud , *COMPUTER vision , *POLYNOMIAL time algorithms , *SOURCE code , *FEATURE extraction - Abstract
Point cloud registration (PCR) is an important and fundamental problem in 3D computer vision, whose goal is to seek an optimal rigid model to register a point cloud pair. Correspondence-based PCR techniques do not require initial guesses and gain more attentions. However, 3D keypoint techniques are much more difficult than their 2D counterparts, which results in extremely high outlier rates. Current robust techniques suffer from very high computational cost. In this paper, we propose a polynomial time ($O(N^2)$ O (N 2) , where $N$ N is the number of correspondences.) outlier removal method. Its basic idea is to reduce the input set into a smaller one with a lower outlier rate based on bound principle. To seek tight lower and upper bounds, we originally define two concepts, i.e., correspondence matrix (CM) and augmented correspondence matrix (ACM). We propose a cost function to minimize the determinant of CM or ACM, where the cost of CM rises to a tight lower bound and the cost of ACM leads to a tight upper bound. Then, we propose a scale-adaptive Cauchy estimator (SA-Cauchy) for further optimization. Extensive experiments on simulated and real PCR datasets demonstrate that the proposed method is robust at outlier rates above 99 percent and 1 $\sim$ ∼ 2 orders faster than its competitors. The source code will be made publicly available in https://ljy-rs.github.io/web/. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
47. Some Upper Bounds and Exact Values on Linear Complexities Over F M of Sidelnikov Sequences for M = 2 and 3.
- Author
-
Zeng, Min, Luo, Yuan, Hu, Guo-Sheng, and Song, Hong-Yeop
- Subjects
- *
SHIFT registers , *DISCRETE Fourier transforms , *DATA transmission systems , *FINITE fields , *FINITE element method , *COMPLEXITY (Philosophy) - Abstract
Sidelnikov sequences, a kind of cyclotomic sequences with many desired properties such as low correlation and variable alphabet sizes, can be employed to construct a polyphase sequence family that has many applications in high-speed data communications. Recently, cyclotomic numbers have been used to investigate the linear complexity of Sidelnikov sequences, mainly about binary ones, although the limitation on the orders of the available cyclotomic numbers makes it difficult. This paper continues to study the linear complexity over $\mathbb {F}_{M}$ of $M$ -ary Sidelnikov sequence of period $q-1$ using Hasse derivative, which implies $q=p^{m}$ , $m\geq 1$ and $M|(q-1)$. The $t$ th Hasse derivative formulas are presented in terms of cyclotomic numbers, and some upper bounds on the linear complexity for $M=2$ and 3 are obtained only with some additional restrictions on $q$. Furthermore, concrete illustrations for several families of these sequences, such as $q\equiv 1\pmod {2}$ and $q\equiv 1\pmod {3}$ , show these upper bounds are tight and reachable; especially for $q=2\times 3^{\lambda }+1 (1\leq \lambda \leq 20)$ , the exact linear complexities over $\mathbb {F}_{3}$ of the ternary Sidelnikov sequences are determined; and it turns out that all the linear complexities of the sequences considered are very close to their periods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. Enumeration of Extended Irreducible Binary Goppa Codes.
- Author
-
Chen, Bocong and Zhang, Guanghui
- Subjects
- *
BINARY codes , *LINEAR codes , *PRIME numbers , *ODD numbers , *CRYPTOSYSTEMS - Abstract
The family of Goppa codes is one of the most interesting subclasses of linear codes. As the McEliece cryptosystem often chooses a random Goppa code as its key, knowledge of the number of inequivalent Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. In this paper we present a new approach to give an upper bound on the number of inequivalent extended irreducible binary Goppa codes. To be more specific, let $n>3$ be an odd prime number and $q=2^{n}$ ; let $r\geq 3$ be a positive integer satisfying $\gcd (r,n)=1$ and $\gcd \big (r,q(q^{2}-1)\big)=1$. We obtain an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
49. Q -Ary Non-Overlapping Codes: A Generating Function Approach.
- Author
-
Wang, Geyang and Wang, Qi
- Subjects
- *
GENERATING functions , *BINARY codes , *QUALITY factor , *HUFFMAN codes , *PROBLEM solving , *PATTERN matching , *GENERALIZATION - Abstract
Non-overlapping codes are a set of codewords in $\bigcup _{n \ge 2} \mathbb {Z}_{q}^{n}$ , where $\mathbb {Z}_{q} = \{0,1, {\dots },q-1\}$ , such that the prefix of each codeword is not a suffix of any codeword in the set, including itself; and for variable-length codes, a codeword does not contain any other codeword as a subword. In this paper, we investigate a generic method to generalize binary codes to $q$ -ary ones for $q > 2$ , and analyze this generalization on the two constructions given by Levenshtein (also by Gilbert; Chee, Kiah, Purkayastha, and Wang) and Bilotta, respectively. The generalization on the former construction gives large non-expandable fixed-length non-overlapping codes whose size can be explicitly determined; the generalization on the latter construction is the first attempt to generate $q$ -ary variable-length non-overlapping codes. More importantly, this generic method allows us to utilize the generating function approach to analyze the cardinality of the underlying $q$ -ary non-overlapping codes. The generating function approach not only enables us to derive new results, e.g., recurrence relations on their cardinalities, new combinatorial interpretations for the constructions, and the superior limit of their cardinalities for some special cases, but also greatly simplifies the arguments for these results. Furthermore, we give an exact formula for the number of fixed-length words that do not contain the codewords in a variable-length non-overlapping code as subwords. This thereby solves an open problem by Bilotta and induces a recursive upper bound on the maximum size of variable-length non-overlapping codes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
50. Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes.
- Subjects
- *
LINEAR codes , *REED-Muller codes , *CYCLIC codes , *ALGEBRAIC codes , *HAMMING distance , *REED-Solomon codes , *HAMMING weight - Abstract
In this paper we prove several coordinate-ordering-free upper bounds on the insdel distances of linear codes. Our bounds are stronger than some previous known bounds. We apply these upper bounds to AGFC codes from some cyclic codes and one algebraic-geometric code with any rearrangement of coordinate positions. A strong upper bound on the insdel distances of Reed-Muller codes with the special coordinate ordering is also given. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.