Behavioral approach to decoding

Margreta Kuijper; Jan W. Polderman

Behavioral approach to decoding

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

23 Downloads (Pure)

Abstract

List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model. The bivariate polynomial is then derived from a specific representation of the MPUM.

Original language	English
Title of host publication	Proceedings of the fifteenth International Symposium of Mathematical Theory of Networks and Systems
Pages	-
Number of pages	13
Publication status	Published - 2002
Event	15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002 - University of Notre Dame, Notre Dame, United States Duration: 12 Aug 2002 → 16 Aug 2002 Conference number: 15

Conference

Conference	15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002
Abbreviated title	MTNS 2002
Country/Territory	United States
City	Notre Dame
Period	12/08/02 → 16/08/02

Keywords

METIS-209233
IR-44404

Access to Document

behavioral_list_decoding_-_kuijperFinal published version, 209 KB

Cite this

@inproceedings{7423853dbe8b4e5f9291e5b07a0adbb7,

title = "Behavioral approach to decoding",

abstract = "List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model. The bivariate polynomial is then derived from a specific representation of the MPUM.",

keywords = "METIS-209233, IR-44404",

author = "Margreta Kuijper and Polderman, {Jan W.}",

year = "2002",

language = "English",

pages = "--",

booktitle = "Proceedings of the fifteenth International Symposium of Mathematical Theory of Networks and Systems",

note = "15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002, MTNS 2002 ; Conference date: 12-08-2002 Through 16-08-2002",

}

TY - GEN

T1 - Behavioral approach to decoding

AU - Kuijper, Margreta

AU - Polderman, Jan W.

N1 - Conference code: 15

PY - 2002

Y1 - 2002

N2 - List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model. The bivariate polynomial is then derived from a specific representation of the MPUM.

AB - List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most Powerful Unfalsified Model. The bivariate polynomial is then derived from a specific representation of the MPUM.

KW - METIS-209233

KW - IR-44404

M3 - Conference contribution

SP - -

BT - Proceedings of the fifteenth International Symposium of Mathematical Theory of Networks and Systems

T2 - 15th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2002

Y2 - 12 August 2002 through 16 August 2002

ER -

Behavioral approach to decoding

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this