11 results
Search Results
2. A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions.
- Author
-
Carlet, Claude and Meaux, Pierrick
- Subjects
BOOLEAN functions ,STREAM ciphers ,CRYPTOGRAPHY - Abstract
In this paper, we make a comprehensive study of two classes of Boolean functions whose interest originally comes from hybrid symmetric-FHE encryption (with stream ciphers like FiLIP), but which also present much interest for general stream ciphers. The functions in these two classes are cheap and easy to implement, and they allow the resistance to all classical attacks and to their guess and determine variants as well. We determine exactly all the main cryptographic parameters (algebraic degree, resiliency order, nonlinearity, algebraic immunity) for all functions in these two classes, and we give close bounds for the others (fast algebraic immunity, the dimension of the space of annihilators of minimal degree). This is the first time that this is done for all functions in large classes of cryptographic interest. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes.
- Author
-
Vehkalahti, Roope and Luzzi, Laura
- Subjects
DIVISION algebras ,SPACE-time codes ,SPACE-time block codes ,NUMBER theory ,MISO - Abstract
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes for the $n \times m$ MIMO channel. Such codes correspond to lattices in $M_{n}(\mathbb {C})$ with dimension smaller than $2n^{2}$. Currently, very little is known about their DMT, except in the case $m=1$ , corresponding to the multiple input single output (MISO) channel. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for a lattice code to achieve these upper bounds. We also show that lattice codes based on $\mathbb {Q}$ -central division algebras satisfy this optimality criterion. As a corollary this result provides a DMT classification for all $\mathbb {Q}$ -central division algebra codes that are based on standard embeddings. While the $\mathbb {Q}$ -central division algebra based codes achieve the largest possible DMT of a code restricted to either real or quaternion space, they still fall short of the optimal DMT apart from the MISO case. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. On One-Dimensional Linear Minimal Codes Over Finite (Commutative) Rings.
- Author
-
Maji, Makhan, Mesnager, Sihem, Sarkar, Santanu, and Hansda, Kalyan
- Subjects
LINEAR codes ,CODING theory ,FINITE rings ,COMMUTATIVE rings ,ALGEBRAIC fields ,ABSTRACT algebra ,FINITE fields - Abstract
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. When they are defined over finite fields, those codes have been intensively studied, especially in recent years, but they have been firstly partially characterized by Ashikhmin and Barg since 1998. Next, they were completely characterized in 2018 by Ding, Heng, and Zhou in terms of the minimum and maximum nonzero weights in the corresponding codes. Since then, many construction methods for minimal linear codes over finite fields throughout algebraic and geometric approaches have been proposed in the literature. In particular, the algebraic approach gives rise to minimal codes from (cryptographic) functions. Linear codes over finite fields have been expanded into the collection of acceptable alphabets for codes and study codes over finite commutative rings. A natural way to extend the known results available in the literature is to consider minimal linear codes over commutative rings with unity. In extending coding theory to codes over rings, several essential principles must be considered. Particularly extending the minimality property from finite fields to rings and creating such codes is not simple. Such an extension offers more flexibility in the construction of minimal codes. The present article investigates one-dimensional minimal linear codes over the rings $\mathbb {Z}_{p^{n}}$ (where $p$ is a prime) and $\mathbb {Z}_{p^{m}q^{n}}$ (where $p < q$ are distinct primes and $m\leq n$). Our ultimate objective is to characterize such codes’ minimality and design minimal linear codes over the considered rings. Given our objective, we first introduced the notion of minimal codes over (commutative) rings and succeeded in deriving simple characterization of one-dimensional minimal linear codes over the underlying rings mentioned above. Our new algebraic approach allows designing new minimal linear codes. Almost minimal codes over rings are also presented. To the best of our knowledge, the present paper offers a wide variety of minimal codes over (commutative) rings for the first time. Novel perspectives and developments in this direction are expected in the future. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Dihedral Group Codes Over Finite Fields.
- Author
-
Fan, Yun and Lin, Liren
- Subjects
FINITE fields ,LIQUID crystal displays ,BINARY codes - Abstract
Bazzi and Mitter showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with strong duality property are asymptotically good. If the characteristic of the field is even, self-dual dihedral group codes are asymptotically good. If the characteristic of the field is odd, maximal self-orthogonal dihedral group codes and LCD dihedral group codes are asymptotically good. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. Efficient Multi Port-Based Teleportation Schemes.
- Author
-
Studzinski, Michal, Mozrzymas, Marek, Kopszak, Piotr, and Horodecki, Michal
- Subjects
TELEPORTATION ,MATHEMATICAL physics ,HARBORS ,QUANTUM states ,REPRESENTATIONS of groups (Algebra) ,QUANTUM teleportation ,TENSOR products - Abstract
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting on $n$ systems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on the $n-$ fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Self-Dual 2-Quasi Abelian Codes.
- Author
-
Lin, Liren and Fan, Yun
- Subjects
FINITE fields ,HAMMING weight - Abstract
A class of self-dual quasi-abelian codes of index 2 over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes in this class whose relative minimum weights are small, such codes are proved to be asymptotically good provided −1 is a square in $F$. Moreover, a class of self-orthogonal quasi-abelian codes of index 2 is defined; and such codes always exist. In a way similar to that for self-dual quasi-abelian codes of index 2, it is proved that these self-orthogonal quasi-abelian codes of index 2 are asymptotically good. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. On a Tracial Version of Haemers Bound.
- Author
-
Gao, Li, Gribling, Sander, and Li, Yinan
- Subjects
QUANTUM numbers ,THETA functions ,QUANTUM entanglement - Abstract
We extend upper bounds on the quantum independence number and the quantum Shannon capacity of graphs to their counterparts in the commuting operator model. We introduce a von Neumann algebraic generalization of the fractional Haemers bound (over $\mathbb {C}$) and prove that the generalization upper bounds the commuting quantum independence number. We call our bound the tracial Haemers bound, and we prove that it is multiplicative with respect to the strong product. In particular, this makes it an upper bound on the Shannon capacity. The tracial Haemers bound is incomparable with the Lovász theta function, another well-known upper bound on the Shannon capacity. We show that separating the tracial and fractional Haemers bounds would refute Connes’ embedding conjecture. Along the way, we prove that the tracial rank and tracial Haemers bound are elements of the (commuting quantum) asymptotic spectrum of graphs (Zuiddam, Combinatorica, 2019). We also show that the inertia bound (an upper bound on the quantum independence number) upper bounds the commuting quantum independence number. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Hadamard Extensions and the Identification of Mixtures of Product Distributions.
- Author
-
Gordon, Spencer L. and Schulman, Leonard J.
- Subjects
PARAMETER estimation ,RANDOM variables - Abstract
The Hadamard Extension $\mathbb H({\mathrm {m}})$ of an $n \times k$ matrix m is the collection of all Hadamard products of subsets of its rows. This construction is essential for source identification (parameter estimation) of a mixture of $k$ product distributions over $n$ binary random variables. A necessary requirement for such identification is that $\mathbb H({\mathrm {m}})$ have full column rank; conversely, identification is possible if apart from each row there exist two disjoint sets of rows of m, each of whose extension has full column rank. It is necessary therefore to understand when $\mathbb H({\mathrm {m}})$ has full column rank; we provide two results in this direction. The first is that if $\mathbb H({\mathrm {m}})$ has full column rank then there exists a set of at most $k-1$ rows of m, whose extension already has full column rank. The second is a Hall-type condition on the values in the rows of m, that suffices to ensure full column rank of $\mathbb H({\mathrm {m}})$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. On the Error Exponents of Binary State Discrimination With Composite Hypotheses.
- Author
-
Mosonyi, Milan, Szilagyi, Zsombor, and Weiner, Mihaly
- Subjects
ERROR probability ,QUANTUM information theory - Abstract
The trade-off between the two types of error probabilities in binary state discrimination may be quantified in the asymptotics by various error exponents. In the composite case, where the hypotheses consist of sets of states, any such exponent is upper bounded by the infimum of the corresponding pairwise exponents of discriminating individual members of the two sets. Attainability of this upper bound may depend on the type of exponents considered; whether the problem is classical or quantum; the cardinality and the geometric properties of the sets representing the hypotheses; and also on the dimensionality of the underlying Hilbert space. Our main contribution is clarifying this landscape considerably. We show that in the quantum case unattainability is the general behaviour for all the exponents, already in finite dimension, for a simple null-hypothesis and an alternative hypothesis consisting of only two states. Moreover, the upper bound may be strict even in the infinite-dimensional classical case if the alternative hypothesis contains at least countably infinitely many states. We also prove general attainability results, e.g., for classical adversarial and arbitrarily varying hypothesis testing, and for the quantum case where all states are pure, or the states commute with every state in the opposite hypothesis. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. Twisted Group Codes.
- Author
-
De La Cruz, Javier and Willems, Wolfgang
- Subjects
GROUP algebras ,HAMMING codes ,AUTOMORPHISM groups ,SYMMETRIC matrices ,FINITE groups - Abstract
We investigate right ideals as codes in twisted group algebras. Such codes are called twisted group codes. It turns out that many interesting codes belong to this class; for instance, the ternary extended Golay code, Hamming codes and constacyclic codes. In particular we characterize all linear codes which are twisted group codes in terms of their automorphism group. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.