the starting behavior of a supersonic axisymmetric mixed compression air intake was numerically investigated. the code solves reynolds-averaged navier–stokes equations using an explicit finite volume method in a structured grid by the roe flux difference splitting scheme. further, it uses the baldwin–lomax algebraic model to compute the turbulent viscosity coefficient. the correct method of sur...

In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V ) constructions with Reed-Solomon code or algebraic geometry code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with the Koetter-Vardy soft decoder used for de...

In CELP, the use of codebooks with entries with only a few non-zero samples provides high speech quality and facilitates fast computation. With decreasing bit-rate, the intervals between the pulses increase, and the quality of the reconstructed signal begins to su er from a particular type of artifact, which is strongest for noise-like segments. In this paper we describe experiments which show ...

In this short note, we describe one of the long-standing open problems in algebraic coding theory, i.e., whether there exists a binary self-dual [72, 36, 16] code.

We give an example of an imaginary defined in certain valued fields with analytic structure which cannot be coded in the ‘geometric’ sorts which suffice to code all imaginaries in the corresponding algebraic setting.

Suppose C is a [n, k, d] code over Fq, t < n is a positive integer. For any received vector y = (y1, · · · , yn) ∈ Fq , we refer to any code word c in C satisfying d(c,y) ≤ t as a tconsistent code word. A decoding problem is in fact the problem of finding an effective (or efficient) algorithm which can find t-consistent code words, and we call such an algorithm a decoding algorithm that can cor...

A joint amplitude and position search procedure is proposed for searching algebraic multipulse codebooks. It is implemented within the reference G.723.1 codec as an example. This joint search method is shown to reduce down to one third the number of comparisons per subframe relative to the focused search over an extensive speech database. An e cient implementation of the joint search is derived...

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.