Results 11 to 20 of about 59 (58)
List Decoding—Random Coding Exponents and Expurgated Exponents [PDF]
IEEE Transactions on Information Theory, 2014 Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed independently of the block length $n$, and the exponential list-size, where $L$ grows exponentially with $n$.
openaire +2 more sources
Extremes of Error Exponents [PDF]
IEEE Transactions on Information Theory, 2013 This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity $C$ and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's $E_0$ function ...
Albert Guillen i Fabregas +2 more
openaire +4 more sources
On inverses of APN exponents [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 In this extended abstract we present results on the inverses modulo 2n − 1 of the known APN exponents. In particular, we describe explicitly the inverses of the Welch and Dobbertin exponents and give the main ideas of their proofs. Further, we observe that the inverse of the Dobbertin exponent defines an APN function on F2n of algebraic degree n+3 ...
Kyureghyan, Gohar, Suder, Valentin
openaire +2 more sources
Generalized Exponents and Forms [PDF]
Journal of Algebraic Combinatorics, 2005 Let \(V=\mathbb{C}^l\) or \(\mathbb{R}^l\) be a complex or real vector space. A reflection is an element of \(\text{GL}(V)\) whose fixed point set is a hyperplane in \(V\). Let \(G\) be a reflection group, i.e., a finite subgroup of \(\text{GL}(V)\) generated by reflections. We assume all \(G\)-modules are \(\mathbb{C} G\)-modules. For any \(G\)-module
openaire +2 more sources
Ljapunov Exponents, Hyperchaos and Hurst Exponent
Zeitschrift für Naturforschung A, 2005 Abstract We consider nonlinear dynamical systems with chaotic and hyperchaotic behaviour.We investigate the behaviour of the Hurst exponent at the transition from chaos to hyperchaos. A two-dimensional coupled logistic map is studied.
Willi-Hans Steeb, Eugenio Cosme Andrieu
openaire +1 more source
The homomorphism domination exponent
European Journal of Combinatorics, 2011 23 ...
Swastik Kopparty, Benjamin Rossman
openaire +2 more sources
Mapped Exponent and Asymptotic Critical Exponent of Words
We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and asymptotic critical exponents of infinite words.
Eva Foster +2 more
openaire +2 more sources
Quantified exponence constraints and the typology of exponence
Proceedings of the Annual Meetings on Phonology, 2018 Both phonologically conditioned suppletive allomorphy (PCSA) and multiple exponence (ME) involve one-to-many mapping between morphosyntactic information and phonological representations. Though they are usually viewed as separate phenomena, the plural marking of Lower Jubba Maay exhibits properties of both PCSA and ME, indicating that they are ...
openaire +2 more sources
Multifractal Analysis Based on p-Exponents and Lacunarity Exponents [PDF]
, 2015 Many examples of signals and images cannot be modeled by locally bounded functions, so that the standard multifractal analysis, based on the Hölder exponent, is not feasible. We present a multifractal analysis based on another quantity, the p-exponent, which can take arbitrarily large negative values. We investigate some mathematical properties of this
Abry, Patrice +4 more
openaire +4 more sources