View Item 

Show simple item record

Cube theory and stable $k$-error linear complexity for periodic sequences

dc.contributor.authorZhou, J.
dc.contributor.authorLiu, Wan-quan
dc.contributor.editorNot known
dc.date.accessioned2017-01-30T13:36:49Z
dc.date.available2017-01-30T13:36:49Z
dc.date.created2014-03-24T20:00:48Z
dc.date.issued2013
dc.identifier.citationZhou, Jianqin and Liu, Wan-quan. 2013. Cube theory and stable $k$-error linear complexity for periodic sequences, in Inscrypt: The 9th China International Conference on Information Security and Cryptology, Nov 27-30 2013. Guangzhou, China: Springer.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/33385
dc.publisherSpringer
dc.titleCube theory and stable $k$-error linear complexity for periodic sequences
dc.typeConference Paper
dcterms.source.titleThe 9th China International Conference on Information Security and Cryptology
dcterms.source.seriesThe 9th China International Conference on Information Security and Cryptology
dcterms.source.conferenceInscrypt 2013
dcterms.source.conference-start-dateNov 27 2013
dcterms.source.conferencelocationGuangzhou, China
dcterms.source.placeOnline
curtin.department
curtin.accessStatusFulltext not available


Files in this item

Thumbnail
Name:
197330_Document.pdf
Size:
80.85Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record