On faster than Nyquist signaling: Computing the minimum distance
type: Item
instance of: scholarly article
title: On faster than Nyquist signaling: Computing the minimum distance
zbMATH Open document ID: 0723.41016
DOI: 10.1016/0021-9045(90)90118-A
author: D. Kharzeev
published in: Journal of Approximation Theory
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 41A29
Mathematics Subject Classification ID: 42A10
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 4192335
zbMATH Keywords: Nyquist signaling
zbMATH Keywords: data communications
MaRDI profile type: Publication
cites work: Performance bound for maximum-likelihood reception of digital data
cites work: On computing the minimum distance for faster than Nyquist signaling
cites work: Faster-Than-Nyquist Signaling
cites work: Upper Bound on Error Probability for Detection With Unbounded Intersymbol Interference
cites work: Q4143689
cites work: Minimum probability of error for asynchronous Gaussian multiple-access channels
full work available at URL: 0021-9045(90)90118-a
OpenAlex ID: W2081272752
description: scientific article; zbMATH DE number 4192335