A minimax method with application to the initial vector coding problem*
From MaRDI portal
Publication:4384040
DOI10.1080/00207169708804590zbMATH Open0895.65031OpenAlexW1978388432MaRDI QIDQ4384040FDOQ4384040
Authors: L. T. Santos, J. M. Martínez, S. A. Santos 
Publication date: 8 September 1998
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169708804590
Recommendations
- A source matching approach to finding minimax codes
- A class of minimum linear codes and their applications
- Minimax nonredundant channel coding
- Optimal codes for minimax criterion on error detection
- On the optimal coding of one class of vector functions
- Minimal vectors in linear codes
- scientific article; zbMATH DE number 4093361
- scientific article; zbMATH DE number 4191549
- On the maximum number of minimal codewords
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
Cites Work
- Title not available (Why is that?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A new trust region algorithm for bound constrained minimization
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- On the Resolution of Linearly Constrained Convex Minimization Problems
- A trust-region strategy for minimization on arbitrary domains
- Permutation codes for the Gaussian channel
- Distance Properties of Group Codes for the Gaussian Channel
This page was built for publication: A minimax method with application to the initial vector coding problem*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384040)
