As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...

This paper studies the phase-only reconstruction problem of recovering a complex-valued signal in from phase where is given measurement matrix . The reconstruction, if possible, should be up to positive scaling factor. By using rank discriminant matrices, uniqueness conditions are derived characterize whether underlying can uniquely reconstructed. We also interested minimal number. show that at...

Following [10] we continue the study of the problem of expected utility maximization in incomplete markets. Our goal is to find minimal conditions on a model and a utility function for the validity of several key assertions of the theory to hold true. In [10] we proved that a minimal condition on the utility function alone, i.e. a minimal market independent condition, is that the asymptotic ela...

Maximal and minimal conditions for ideals in associative rings have often been considered, but little seems to be known of these conditions in non-associative rings, or of chain conditions on the non-normal subgroups of a group. Moreover, it is usual to assume the condition for one-sided ideals in noncommutative rings, and the weaker condition for two-sided ideals rarely appears. In this note w...