Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences

DOI10.1109/TIT.2004.836698zbMath1288.94006WikidataQ59750819 ScholiaQ59750819MaRDI QIDQ3547719

Inderjit S. Dhillon, Robert W. jun. Heath, Joel A. Tropp

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (13)

Newton-type methods for inverse singular value problems with multiple singular values ⋮ Unnamed Item ⋮ Constructing all self-adjoint matrices with prescribed spectrum and diagonal ⋮ Two-step inexact Newton-type method for inverse singular value problems ⋮ A geometric Gauss-Newton method for least squares inverse eigenvalue problems ⋮ Optimization over finite frame varieties and structured dictionary design ⋮ Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements ⋮ An extended Ulm-like method for inverse singular value problems with multiple and/or zero singular values ⋮ Extended Newton-type method for inverse singular value problems with multiple and/or zero singular values ⋮ Frame completion with prescribed norms via alternating projection method ⋮ Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems ⋮ Convergence of a Ulm-like method for square inverse singular value problems with multiple and zero singular values ⋮ Convergence of the Newton-type methods for the square inverse singular value problems with multiple and zero singular values

This page was built for publication: Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences