|
|
|
|
ON THE MINIMUM STOPPING SETS OF PRODUCT CODES
|
|
|
|
|
|
|
|
نویسنده
|
hivadi morteza ,zare chavoshi akbar
|
|
منبع
|
transactions on combinatorics - 2018 - دوره : 7 - شماره : 4 - صفحه:1 -16
|
|
چکیده
|
It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding. in this paper, the number of minimum stopping setsof a product code is determined by the number of the minimum stopping sets of the correspondingcomponent codes. as an example, the number of minimum stopping sets of the r-dimensional spcproduct code is computed.
|
|
کلیدواژه
|
Stopping set ,Stopping distance ,Product code
|
|
آدرس
|
institute for advanced studies in basic sciences, department of mathematics, iran, malek ashtar university of technology, department of mathematics, Iran
|
|
پست الکترونیکی
|
nonemail@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|