multi-continued fraction algorithm and generalized b-m algorithm over     f-2*

ISCAS OpenIR

	multi-continued fraction algorithm and generalized b-m algorithm over f-2*
	Dai ZD; Feng XT; Yang JH
	2005
会议名称	3rd International Conference Sequences and Their Applications (SETA 2004)
会议录名称	Lecture Notes in Computer Science
页码	339-354
会议日期	OCT 24-28,
会议地点	Seoul, SOUTH KOREA
收录类别	sci ; istp ; ei
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	SEQUENCES AND THEIR APPLICATIONS - SETA 2004
ISSN	0302-9743
ISBN	3-540-26084-6
部门归属	Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China. Chinese Acad Sci, Software Inst, Beijing 100049, Peoples R China.
摘要	It is shown that the generalized Berlekamp-Massey algorithm (GBMA, in short) for solving the linear synthesis problem of a multi-sequence (r) under bar over F-2 can be obtained naturally from a special form of the multi-continued fraction algo
关键词	Data Reduction Problem Solving
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12750
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Dai ZD,Feng XT,Yang JH. multi-continued fraction algorithm and generalized b-m algorithm over f-2*[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:SEQUENCES AND THEIR APPLICATIONS - SETA 2004,2005:339-354.