[Paper Review] Quotients of Orders in Cyclic Algebras and Space-Time Codes

Frédérique Oggier, B. A. Sethuraman|arXiv (Cornell University)|Oct 26, 2012

Coding theory and cryptography8 references3 citations

TL;DR

This paper develops a general framework for constructing space-time codes using quotients of orders in cyclic division algebras over number fields. By analyzing two-sided ideals of the form $\mathfrak{q}^s\Lambda$, it identifies families of finite rings—such as matrix rings over finite fields and generalized cyclic algebras—that arise as quotients, enabling systematic coset coding with improved coding gain and flexibility for space-time coded modulation and wiretap applications.

ABSTRACT

Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $Λ$ in $\Dc$ by two-sided ideals. We reduce the problem to studying the ideal structure of $Λ/\qf^sΛ$, where $\qf$ is a prime ideal in $\Oc_F$, $s\geq 1$. We study the case where $\qf$ remains unramified in $K$, both when $s=1$ and $s>1$. This work is motivated by its applications to space-time coded modulation.

Motivation & Objective

• To generalize coset coding in space-time codes beyond prior constructions using specific small matrix rings.
• To characterize the structure of quotients $\Lambda/\mathfrak{q}^s\Lambda$ where $\Lambda$ is an order in a cyclic division algebra and $\mathfrak{q}$ is an unramified prime ideal.
• To identify families of finite rings that arise as quotients, particularly matrix rings over finite rings, to support systematic code design.
• To provide a theoretical foundation for optimizing the minimum determinant in space-time coded modulation and wiretap coding.

Proposed method

• Reduces the problem of classifying quotients of orders in division algebras to studying $\Lambda/\mathfrak{q}^s\Lambda$ for prime ideals $\mathfrak{q}$ unramified in the maximal cyclic subfield $K$.
• Uses the isomorphism $\Lambda/\mathfrak{q}^s\Lambda \cong \mathcal{M}_n(\mathcal{O}_F/\mathfrak{q}^s)$ when $\mathfrak{q}$ is unramified and $\mathfrak{q}\mathcal{O}_K = \mathfrak{Q}_1\cdots\mathfrak{Q}_g$ splits completely.
• Applies the structure theorem for orders in division algebras to show that quotients are direct sums of generalized cyclic algebras over finite rings.
• Derives a key inequality on the determinant of a sum of positive-definite matrices to bound the minimum determinant $\Delta_{\text{min}}$ in terms of Hamming distance and ideal index.
• Constructs outer codes $\bar{\mathcal{C}}$ as additive subgroups of $\oplus_{i=1}^L \Lambda/\mathcal{J}$, lifting them to inner codes $\mathcal{C} \subset \oplus_{i=1}^L \Lambda$ via preimage construction.
• Illustrates the framework with examples where $\Lambda/\mathcal{J} \cong \mathcal{M}_n(\mathbb{F}_q)$ or $\mathcal{M}_n(\mathcal{O}_K/\mathfrak{q}^s)$, showing trade-offs in coding gain and symbol rate.

Experimental results

Research questions

• RQ1 Which finite rings can arise as quotients $\Lambda/\mathcal{J}$ for two-sided ideals $\mathcal{J}$ in an order $\Lambda$ of a cyclic division algebra over a number field?
• RQ2 How does the structure of $\Lambda/\mathfrak{q}^s\Lambda$ depend on the splitting behavior of the prime ideal $\mathfrak{q}$ in the maximal cyclic subfield $K$?
• RQ3 What is the relationship between the Hamming distance of the outer code and the minimum determinant $\Delta_{\text{min}}$ in space-time coded modulation?
• RQ4 Can the quotient rings $\Lambda/\mathfrak{q}^s\Lambda$ be described in terms of well-known rings like matrix rings over finite fields or rings of integers modulo $\mathfrak{q}^s$?
• RQ5 How can the framework be extended to design codes that maximize $\Delta_{\text{min}}$ while balancing symbol rate and complexity?

Key findings

• When $\mathfrak{q}$ is unramified in $K$ and splits completely as $\mathfrak{q}\mathcal{O}_K = \mathfrak{Q}_1\cdots\mathfrak{Q}_g$, the quotient $\Lambda/\mathfrak{q}^s\Lambda$ is isomorphic to $\mathcal{M}_n(\mathcal{O}_F/\mathfrak{q}^s)$.
• The two-sided ideals of $\Lambda$ containing $\mathfrak{q}^s\Lambda$ are precisely $\mathcal{J}_t = \mathfrak{q}^t\Lambda$ for $1 \leq t \leq s$, and $\Lambda/\mathcal{J}_t \cong \mathcal{M}_n(\mathcal{O}_F/\mathfrak{q}^t)$.
• For $s=1$, if $\mathfrak{q}$ is unramified and $\mathcal{O}_K/\mathfrak{q}\mathcal{O}_K$ is a field, then $\Lambda/\mathfrak{q}\Lambda \cong \mathcal{M}_n(\mathbb{F}_q)$, a matrix ring over a finite field.
• When $\mathfrak{q}$ is unramified and $\mathcal{O}_K/\mathfrak{q}\mathcal{O}_K$ is a product of fields, the quotient $\Lambda/\mathfrak{q}\Lambda$ is isomorphic to a direct sum of matrix rings over finite fields.
• The minimum determinant $\Delta_{\text{min}}$ is bounded below by $\min\left(d_H(\bar{\mathcal{C}})^2 \min_{0\neq x_i} |\det(X_i)|^2, \min_{0\neq x_i \in \mathcal{J}} |\det(X_i)|^2 \right)$, linking code design to ideal structure.
• The framework generalizes prior constructions using $\mathcal{M}_2(\mathbb{F}_2)$, $\mathcal{M}_3(\mathbb{F}_3)$, and $\mathcal{M}_4(\mathbb{F}_4)$ as quotient rings, now embedded in a broader algebraic structure.