arXiv (All)
open access
Integer-Forcing Precoding: A Geometric Perspective and Low-Complexity Algorithm Design
The joint coefficient--scaling design of integer-forcing (IF) precoding couples a full-rank integer coefficient matrix with a positive diagonal scaling matrix, resulting in a mixed discrete--continuous optimization problem. We first distinguish the original full-rank formulation and its finite-field
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- A Sparse Corner-Difference MILP for Minimum Square Tiling#1035855
- Global Optimization of Mixed-Integer Bound-Constrained Quadratic Fractional Problems#1200406
- Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration#1249193
- Connections Between Quadratic Transform for Fractional Programming and Schur Complement#1036120
Record · ID 1297043
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive