21 results
Search Results
2. On the Combinatorics of Locally Repairable Codes via Matroid Theory.
- Author
-
Westerback, Thomas, Freij-Hollanti, Ragnar, Ernvall, Toni, and Hollanti, Camilla
- Subjects
COMBINATORICS ,COMBINATORIAL probabilities ,COMBINATORIAL group theory ,MATROIDS ,LINEAR dependence (Mathematics) - Abstract
This paper provides a link between matroid theory and locally repairable codes (LRCs) that are either linear or more generally almost affine. Using this link, new results on both LRCs and matroid theory are derived. The parameters $(n,k,d,r,\delta )$ of LRCs are generalized to matroids, and the matroid analog of the generalized singleton bound by Gopalan et al. for linear LRCs is given for matroids. It is shown that the given bound is not tight for certain classes of parameters, implying a nonexistence result for the corresponding locally repairable almost affine codes that are coined perfect in this paper. Constructions of classes of matroids with a large span of the parameters $(n,k,d,r,\delta )$ and the corresponding local repair sets are given. Using these matroid constructions, new LRCs are constructed with prescribed parameters. The existence results on linear LRCs and the nonexistence results on almost affine LRCs given in this paper strengthen the nonexistence and existence results on perfect linear LRCs given by Song et al. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
3. Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction.
- Author
-
Zhou, Zhengchun, Li, Xia, Tang, Chunming, and Ding, Cunsheng
- Subjects
LINEAR codes ,INJECTIONS ,POLYNOMIALS ,BINARY codes ,GENERIC drugs - Abstract
Linear codes with certain special properties have received renewed attention in recent years due to their practical applications. Among them, binary linear complementary dual (LCD) codes play an important role in implementations against side-channel attacks and fault injection attacks. Self-orthogonal codes can be used to construct quantum codes. In this paper, four classes of binary linear codes are constructed via a generic construction which has been intensively investigated in the past decade. Simple characterizations of these linear codes to be LCD or self-orthogonal are presented. Resultantly, infinite families of binary LCD codes and self-orthogonal codes are obtained. Infinite families of binary LCD codes from the duals of these four classes of linear codes are produced. Many LCD codes and self-orthogonal codes obtained in this paper are optimal or almost optimal in the sense that they meet certain bounds on general linear codes. In addition, the weight distributions of two sub-families of the proposed linear codes are established in terms of Krawtchouk polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. Comments on Cut-Set Bounds on Network Function Computation.
- Author
-
Huang, Cupjin, Tan, Zihan, Yang, Shenghao, and Guang, Xuan
- Subjects
LINEAR network coding ,COMPUTER systems ,INFORMATION theory ,TOPOLOGY ,MATHEMATICS - Abstract
A function computation problem over a directed acyclic network has been considered in the literature, where a sink node is required to compute a target function correctly with the inputs arbitrarily generated at multiple source nodes. The network links are error free but capacity limited, and the intermediate nodes perform network coding. The computing rate of a network code is the average number of times that the target function is computed for one use of the network, i.e., each link in the network is used at most once. In the existing papers, two cut-set bounds were proposed on the computing rate. However, we in this paper show that these bounds are not valid for general network function computation problems. We analyze the reason of the invalidity and propose a general cut-set bound by using a new equivalence relation associated with the inputs of the target function. Moreover, some results in the existing papers were proved by applying the invalid upper bound. We also justify the validity of these results. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. Narrow-Sense BCH Codes Over \mathrm GF(q) With Length n=\frac q^m-1q-1.
- Author
-
Li, Shuxing, Ding, Cunsheng, Xiong, Maosheng, and Ge, Gennian
- Subjects
CYCLIC codes ,QUADRATIC forms ,BCH codes ,DECODING algorithms ,TELECOMMUNICATION systems - Abstract
Cyclic codes are widely employed in communication systems, storage devices, and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over \mathrm GF(q) with length n=(q^m-1)/(q-1) . Little is known about this class of BCH codes when $q>2$ . The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length n=(3^{m}-1)/2 are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
6. Characterization of a Class of Fuzzy Implication Functions Satisfying the Law of Importation With Respect to a Fixed Uninorm—Part II.
- Author
-
Massanet, Sebastia, Ruiz-Aguilera, Daniel, and Torrens, Joan
- Subjects
IMPLICIT functions ,FUZZY logic ,IMAGE processing - Abstract
The law of importation is an important property of fuzzy implication functions because of its interesting applications in approximate reasoning and image processing. In this paper, as a continuation of the paper [S. Massanet, D. Ruiz-Aguilera, and J. Torrens, “Characterization of a class of fuzzy implication functions satisfying the law of importation with respect to a fixed uninorm—Part I,” IEEE Trans. Fuzz Syst. , to be published.], the characterization of all fuzzy implication functions that satisfy the law of importation with respect to a given uninorm $U$ , and having an $\alpha$ -section that is a continuous fuzzy negation is given for the cases when the uninorm $U$ lies in one of the most used classes of uninorms. As the case when the uninorm $U$ is in ${\mathcal U}_{\min }$ was already solved in [S. Massanet, D. Ruiz-Aguilera, and J. Torrens, “Characterization of a class of fuzzy implication functions satisfying the law of importation with respect to a fixed uninorm—Part I,” IEEE Trans. Fuzz Syst., to be published.], this paper focuses in the cases when $U$ is an idempotent uninorm, a representable uninorm, or a uninorm continuous in the open unit square. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
7. Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.
- Author
-
Xiang, Can, Ding, Cunsheng, and Mesnager, Sihem
- Subjects
BINARY codes ,MATHEMATICAL bounds ,SET theory ,HAMMING distance ,MULTIPLE access protocols (Computer network protocols) - Abstract
In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
8. New Constructions of MDS Codes With Complementary Duals.
- Author
-
Chen, Bocong and Liu, Hongwei
- Subjects
LINEAR complementarity problem ,REED-Solomon codes ,DIGITAL signal processing -- Mathematics ,REED-Muller codes ,COMPLEMENTARITY constraints (Mathematics) ,MATHEMATICAL optimization - Abstract
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for given length and code size. Constructing LCD MDS codes is thus of significance in theory and practice. Recently, Jin constructed several classes of LCD MDS codes through generalized Reed-Solomon codes. In this paper, a different approach is proposed to obtain new LCD MDS codes from generalized Reed-Solomon codes. Consequently, new code constructions are provided and certain previously known results by Jin are extended. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
9. Ordered Directionally Monotone Functions: Justification and Application.
- Author
-
Bustince, Humberto, Barrenechea, Edurne, Sesma-Sara, Mikel, Lafuente, Julio, Dimuro, Gracaliz Pereira, Mesiar, Radko, and Kolesarova, Anna
- Subjects
MONOTONIC functions ,MATHEMATICAL functions - Abstract
In this paper, we introduce the notion of ordered directionally monotone function as a type of function which allows monotonicity along different directions in different points. In particular, these functions take into account the ordinal size of the coordinates of the inputs in order to fuse them. We show several examples of these functions and we study their properties. Finally, we present an illustrative example of an application which justifies the introduction and the study of the concept of ordered directional monotonicity. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
10. Three-Way Channels With Multiple Unicast Sessions: Capacity Approximation via Network Transformation.
- Author
-
Chaaban, Anas, Maier, Henning, Sezgin, Aydin, and Mathar, Rudolf
- Subjects
GAUSSIAN channels ,NEUTRALIZATION theory ,CRIMINOLOGY ,MATHEMATICAL constants ,MATHEMATICS - Abstract
A network of three nodes mutually communicating with each other is studied. This multi-way network is a suitable model for three-user device-to-device communications. The main goal of this paper is to characterize the capacity region of the underlying Gaussian three-way channel (3WC) within a constant gap. To this end, a capacity outer bound is derived using cut-set bounds and genie-aided bounds. For achievability, the 3WC is first transformed into an equivalent star channel. This latter is then decomposed into a set of “successive” sub-channels, leading to a sub-channel allocation problem. Using backward decoding, interference neutralization, and known results on the capacity of the star-channel relying of physical-layer network coding, an achievable rate region for the 3WC is obtained. It is then shown that the achievable rate region is within a constant gap of the developed outer bound, leading to the desired capacity approximation. Interestingly, in contrast to the Gaussian two-way channel (TWC), adaptation is necessary in the 3WC. Furthermore, message splitting is another ingredient of the developed scheme for the 3WC, which is not required in the TWC. The two setups are, however, similar in terms of their sum-capacity pre-log, which is equal to 2. Finally, some interesting networks and their approximate capacities are recovered as special cases of the 3WC, such as the cooperative broadcast channel and multiple access channel. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
11. Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions.
- Author
-
Mesnager, Sihem and Sinak, Ahmet
- Subjects
FINITE fields ,INFORMATION theory ,HAMMING weight ,LINEAR codes - Abstract
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods for linear codes from functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three-weight linear codes from weakly regular plateaued functions based on the second generic construction and then determine their weight distributions. We also give a punctured version and subcode of each constructed code. We note that they may be (almost) optimal codes and can be directly employed to obtain (democratic) secret sharing schemes, which have diverse applications in the industry. We next observe that the constructed codes are minimal for almost all cases and finally describe the access structures of the secret sharing schemes based on their dual codes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
12. The Weight Hierarchy of Some Reducible Cyclic Codes.
- Author
-
Xiong, Maosheng, Li, Shuxing, and Ge, Gennian
- Subjects
HAMMING weight ,LINEAR codes ,CYCLIC codes ,VECTOR spaces ,CRYPTOGRAPHY - Abstract
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we study the GHWs for a family of reducible cyclic codes and obtain the complete weight hierarchy in several cases. This is achieved by extending the idea of Yang et al. into higher dimension and by employing some interesting combinatorial arguments. It shall be noted that these cyclic codes may have arbitrary number of nonzeros. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
13. Pseudo-cyclic Codes and the Construction of Quantum MDS Codes.
- Author
-
Li, Shuxing, Xiong, Maosheng, and Ge, Gennian
- Subjects
ERROR-correcting codes ,QUANTUM communication ,MATHEMATICAL models ,CODING theory ,CYCLIC codes - Abstract
Constacyclic codes which generalize the classical cyclic codes have played important roles in recent constructions of many new quantum maximum distance separable (MDS) codes. However, the mathematical mechanism may not have been fully understood. In this paper, we use pseudo-cyclic codes, which is a further generalization of constacyclic codes, to construct the quantum MDS codes. We can not only provide a unified explanation of many previous constructions, but also produce some new quantum MDS codes. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
14. MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction.
- Author
-
Luo, Gaojun, Cao, Xiwang, and Chen, Xiaojing
- Subjects
HAMMING codes ,QUANTUM entanglement ,LINEAR codes ,REED-Solomon codes ,ERROR-correcting codes - Abstract
The hull of linear codes has promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed–Solomon codes and extended generalized Reed–Solomon codes over finite fields with respect to the Euclidean inner product. Several infinite families of MDS codes with hulls of arbitrary dimensions are presented. As an application, using these MDS codes with hulls of arbitrary dimensions, we construct several new infinite families of entanglement-assisted quantum error-correcting codes with flexible parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
15. Cross-Domain Matching with Squared-Loss Mutual Information.
- Author
-
Yamada, Makoto, Sigal, Leonid, Raptis, Michalis, Toyoda, Machiko, Chang, Yi, and Sugiyama, Masashi
- Subjects
CARTESIAN coordinates ,COORDINATE axes (Mathematics) ,ANALYTIC geometry ,MATHEMATICS ,DIMENSIONS - Abstract
The goal of cross-domain matching (CDM) is to find correspondences between two sets of objects in different domains in an unsupervised way. CDM has various interesting applications, including photo album summarization where photos are automatically aligned into a designed frame expressed in the Cartesian coordinate system, and temporal alignment which aligns sequences such as videos that are potentially expressed using different features. In this paper, we propose an information-theoretic CDM framework based on squared-loss mutual information (SMI). The proposed approach can directly handle non-linearly related objects/sequences with different dimensions, with the ability that hyper-parameters can be objectively optimized by cross-validation. We apply the proposed method to several real-world problems including image matching, unpaired voice conversion, photo album summarization, cross-feature video and cross-domain video-to-mocap alignment, and Kinect-based action recognition, and experimentally demonstrate that the proposed method is a promising alternative to state-of-the-art CDM methods. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
16. Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions.
- Author
-
Chen, Bocong, Lin, Liren, and Liu, Hongwei
- Subjects
CYCLIC codes ,HAMMING distance ,METRIC spaces ,DISCRETE Fourier transforms ,FINITE fields - Abstract
Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that pair distance cannot be improved for given length and code size. The contribution of this paper is twofold. First, we present three lower bounds for the minimum pair distance of constacyclic codes, the first two of which generalize the previously known results due to Cassuto and Blaum (2011) and Kai et al. (2015). The third one exhibits a lower bound for the minimum pair distance of repeated-root cyclic codes. Second, we obtain new MDS symbol-pair codes with minimum pair distance seven and eight through repeated-root cyclic codes. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
17. On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers.
- Author
-
Chatterjee, Tapas, Laha, Ayantika, and Sanadhya, Somitra Kumar
- Subjects
BLOCK ciphers ,FINITE rings ,COMMUTATIVE rings ,FINITE fields ,FINITE groups - Abstract
In 2016, Chang et al. proposed a Format Preserving Encryption (FPE) scheme over a finite field and used an MDS matrix in the diffusion layer of the scheme for optimal diffusion. Later that year, Gupta et al. defined an algebraic structure named Format Preserving Set (FPS) is the diffusion layer of an FPE scheme. In 2018, Barua et al. showed that it is not possible to construct an FPS over a finite field in the diffusion layer of an FPE scheme if the cardinality of the set is not a power of prime. They extended the search of FPS over a finite commutative ring $\mathcal {R}$ and showed that if an FPS $S \subseteq \mathcal {R}$ is closed under addition then it gets module structure over some subring of $\mathcal {R}$. Moreover, in this case, the only possible cardinalities of FPS are some power of the cardinalities of subrings when the module is free. The purpose of this article is twofold. Firstly, we show that it is possible to construct format preserving sets over a finite commutative ring which are not closed under addition. Secondly, we search for format preserving sets and MDS matrices over torsion modules. We provide examples of format preserving sets of cardinalities 26 and 52 over torsion modules and rings. These cardinalities are interesting because they correspond to the set of English alphabets, without and with capitalization. By considering a finite Abelian group as a torsion module over a PID, we show that a matrix $M$ with entries from the PID is MDS if and only if $M$ is MDS under the projection map on the same Abelian group. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. Distributivity and Conditional Distributivity for Uninorms With Continuous Underlying Operators Over a Given Continuous t-Norm.
- Author
-
Su, Yong, Zong, Wenwen, and Wu, Jianrong
- Subjects
AGGREGATION operators ,TRIANGULAR norms ,DISTRIBUTIVE lattices - Abstract
This article focuses on distributivity and conditional distributivity for uninorms over a given continuous t-norm, closely related to the open problem recalled by Klement in the Linz2000 closing session. This problem has been solved for the well-known classes of uninorms except the class of uninorms with the continuous underlying operators. In this article, the complete characterizations of uninorms with continuous underlying operators (conditionally) distributive over a given continuous t-norm are presented. From the obtained results, we deduce that conditional distributivity is equivalent to distributivity for a pair of such operators. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
19. On Constacyclic Codes Over $\mathbb{Z}_4[v]/\langle v^2-v \rangle$ and Their Gray Images.
- Author
-
Q. Dinh, Hai, Singh, Abhay Kumar, Kumar, Narendra, and Sriboonchitta, Songsak
- Abstract
In this letter, we discuss the construction of all constacyclic codes over $R = \mathbb {Z}_{4}[v]/\langle v^{2}-v \rangle $. Some significant properties of linear codes over $R$ have been explored. The self-dual constacyclic codes for odd length over $R$ are determined. Several examples of $(1 + {2}v)$ - constacyclic codes and $(3 + {2}v)$ -constacyclic codes over $R$ , whose $\mathbb {Z}_{4}$ -images are new $\mathbb {Z}_{4}$ -linear codes with better parameters, are provided. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
20. A Digital Coach That Provides Affective and Social Learning Support to Low-Literate Learners.
- Author
-
Schouten, Dylan G.M., Venneker, Fleur, Bosse, Tibor, Neerincx, Mark A., and Cremers, Anita H.M.
- Abstract
In this study, we investigate if a digital coach for low-literate learners that provides cognitive learning support based on scaffolding can be improved by adding affective learning support based on motivational interviewing, and social learning support based on small talk. Several knowledge gaps are identified: motivational interviewing and small talk must be translated to control rules for this coach, a formal model of participant emotional states is needed to allow the coach to parse the learner's emotional state, and various sensors must be used to let the coach detect and act on this state. We use the situated Cognitive Engineering (sCE) method to update an existing foundation of knowledge with emotional models, motivational interviewing, and small talk theory, technology, and a new exercise in the volunteer work domain. We use this foundation to create a design specification for an Embodied Conversational Agent (ECA) coach that provides cognitive, affective, and social learning support for this exercise. A prototype is created, and compared to a prototype that only provides cognitive support in a within- and between-subjects experiment. Results show that both prototypes work as expected: learners interact with the coach and complete all exercises. Almost no significant differences are found between the two prototypes, indicating that the affective and social support were not effective as designed. Potential improvements are provided for future work. Results also show significant differences between two subgroups of low-literate participants, and between men and women, reinforcing the importance of using individualized support measures with this demographic. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
21. Restricted Composition Deletion Correcting Codes.
- Author
-
Cullina, Daniel, Kiyavash, Negar, and Kulkarni, Ankur A.
- Subjects
CODING theory ,PERMUTATIONS ,COMBINATORICS ,MATHEMATICS - Abstract
We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoretic methods to characterize codes, establish bounds on code size, and describe constructions. The substring partial order has a well-known property. For any string, the number of superstrings of a particular length depends only on the length of the original string. We generalize this property to take compositions into account. For any string, the number of superstrings of a particular composition depends only on the composition of the original string. We present a bijective proof of this fact. We apply this result to obtain a lower bound on the size of restricted composition codes. We obtain an upper bound by analyzing deletion errors when the composition of deleted symbols is restricted to a particular worst case composition. We construct binary restricted composition single-deletion correcting codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of restricted composition codes as long as the set of compositions used themselves form a code. The nonbinary single-deletion correcting codes constructed by Tenengolts are a special case of our method. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.