Applicable Algebra in Engineering, Communication and Computing publishes mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Coverage includes vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology. The journal offers papers dealing with problems in commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, among others.
Applicable Algebra in Engineering, Communication and Computing
Description
Identifiers
ISSN | 0938-1279 |
e-ISSN | 1432-0622 |
DOI | 10.1007/200.1432-0622 |
Publisher
Springer Berlin Heidelberg
Additional information
Data set: Springer
Articles
Applicable Algebra in Engineering, Communication and Computing > 2019 > 30 > 6 > 453-469
Codebooks with small inner-product correlation are preferred in many practical applications such as direct spread code division multiple access communications, coding theory, compressed sensing and so on. Heng et al. (IEEE Trans Inf Theory 63(10):6179–6187, 2017), Heng (Discrete Appl Math 250:227–240, 2018) and Luo and Cao (IEEE Trans Inf Theory 64(10):6498–6505, 2018) proposed constructions of asymptotically...
Applicable Algebra in Engineering, Communication and Computing > 2019 > 30 > 6 > 509-539
Let $$A, B \in \mathbb {K} [X, Y]$$ A , B ∈ K [ X , Y ] be two bivariate polynomials over an effective field $$\mathbb {K}$$ K , and let G be the reduced Gröbner basis of the ideal $$I :=\langle A, B \rangle $$ I : = ⟨ A , B ⟩ generated by A and B with respect to the usual degree lexicographic order. Assuming A and B sufficiently generic, we design a quasi-optimal algorithm for...
Applicable Algebra in Engineering, Communication and Computing > 2019 > 30 > 6 > 471-490
In this paper we present a class of 2D skew-cyclic codes over $$R={\mathbb {F}}_{q}+u{\mathbb {F}}_{q}, u^2=1$$ R = F q + u F q , u 2 = 1 , using the bivariate skew polynomial ring $$R[x,y,\theta ,\sigma ]$$ R [ x , y , θ , σ ] , where $${\mathbb {F}}_q$$ F q is a finite field, and $$\theta $$ θ and $$\sigma $$ σ are two commuting automorphisms of R. After defining...