摘要
针对兔子序列的生成提出了一种基于链表的实现方法,并采用C语言编程实现.选取不同的起点,该方法可生成大量0—1序列,能较好地应用于数字水印中决策等需求.同时,该方法能更形象地表达兔子序列的生成过程,进一步体现链表的动态存储特性,可作为"数据结构"与"程序设计"等课程的实践案例.
A novel method is proposed to generate rabbit sequence and realized by C programming,which can gen- erate lots of 0--1 sequences by selecting different starting points. The sequences can be well applied to watermark- ing decision. Furthermore, the method vividly display the generating process of rabbit sequence, which reflects the dynamic storage characteristics of linked lists. Thus, the method can be used as a case in course teaching of data structure or program design.
出处
《南京信息工程大学学报（自然科学版）》
CAS
2012年第6期555-558,共4页
Journal of Nanjing University of Information Science & Technology（Natural Science Edition）
基金
江苏高校优势学科建设工程资助项目
