Search results for "COD"
showing 10 items of 2985 documents
Sparse Image Representation by Directionlets
2010
Despite the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency and sparsity of its representation are limited by the spatial symmetry and separability of its basis functions built in the horizontal and vertical directions. One-dimensional discontinuities in images (edges or contours), which are important elements in visual perception, intersect too many wavelet basis functions and lead to a non-sparse representation. To capture efficiently these elongated structures characterized by geometrical regularity along different directions (not only the horizontal and vertical), a more complex multidirectional (M-DIR) and asymmetric transform is requi…
Uniform rectifiability implies Varopoulos extensions
2020
We construct extensions of Varopolous type for functions $f \in \text{BMO}(E)$, for any uniformly rectifiable set $E$ of codimension one. More precisely, let $\Omega \subset \mathbb{R}^{n+1}$ be an open set satisfying the corkscrew condition, with an $n$-dimensional uniformly rectifiable boundary $\partial \Omega$, and let $\sigma := \mathcal{H}^n\lfloor_{\partial \Omega}$ denote the surface measure on $\partial \Omega$. We show that if $f \in \text{BMO}(\partial \Omega,d\sigma)$ with compact support on $\partial \Omega$, then there exists a smooth function $V$ in $\Omega$ such that $|\nabla V(Y)| \, dY$ is a Carleson measure with Carleson norm controlled by the BMO norm of $f$, and such th…
L’evoluzione del diritto penale: tra codice e legislazione “extra codicem”.
2013
L'articolo affronta il problema dei rapporti tra il codice penale e la legislazione extracodicistica.
Combinations of discourse markers with repairs and repetitions in English, French and Spanish
2020
Abstract Discourse markers have a central role in planning and repairing processes of speech production. They relate with fluency and disfluency phenomena such as pauses, repetitions and reformulations. Their polyfunctionality is challenging and few form-function mappings are stable cross-linguistically. This study combines a functional and a structural approach to discourse markers and their combination with and within repetitions and self-repairs in native English, French and Spanish, in order to establish the inter-relation between these three fluency-related devices and to find potentially universal patterns of use. Qualitative coding and quantitative analyses of categories of markers a…
On the subset sum problem for finite fields
2021
Abstract Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving an explicit formula for the number of subsets of G of prescribed size whose elements sum up to a given element of G. They also determined a closed-form expression for the case where the subsets are required to contain only nonzero elements. In this paper we give an alternative proof of the two formulas. Our argument is purely combinatorial, as in the original proof by Li and Wan, but follows a different and somehow more “natural” approach. We also indicate some new connections with coding theory and combinatorial designs.
Combinatorial isomorphism between Fibonacci classes
2008
Abstract In 1985 Simion and Schmidt showed that the set S n (T 3) of length n permutations avoiding the set of patterns T 3={123, 132, 213} is counted by (the second order) Fibonacci numbers. They also presented a constructive bijection between the set F n–1 of length (n–1) binary strings with no two consecutive 1s and S n (T 3). In 2005, Egge and Mansour generalized the first Simion-Simion’s result and showed that S n (T p ), the set of permutations avoiding the patterns T p ={12…p, 132, 213}, is counted by the (p–1)th order Fibonacci numbers. In this paper we extend the second Simion-Schmidt’s result by giving a bijection between the set of length (n–1) binary strings with no (p–1) consec…
On the weight distribution of perfect binary codes
2021
In this paper, we give a new proof of the closed-form formula for the weight distribution of a perfect binary single-error-correcting code.
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
On the loopless generation of binary tree sequences
1998
Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.
Divisible designs from semifield planes
2002
AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.