Login
EN
[EN] English
[FR] Français
Login
EN
[EN] English
[FR] Français
Give us feedback
Search and explore
Search
Explore ORBilu
Open Science
Open Science
Open Access
Research Data Management
Definitions
Love My Data 11 - 15 Mar 2024
Statistics
Help
User Guide
FAQ
Publication list
Document types
Training
Legal Information
Data protection
Legal notices
About
About ORBilu
Deposit Mandate
ORBilu team
Impact and visibility
About statistics
About metrics
OAI-PMH
Project history
Back
Home
Detailled Reference
Request a copy
Article (Scientific journals)
A combinatorial proof of $S$-adicity for sequences with linear complexity
Leroy, Julien
;
Richomme, Gwenaël
2013
•
In
Integers, 13
, p. 5, 19
Peer Reviewed verified by ORBi
Permalink
https://hdl.handle.net/10993/14832
Files (1)
Send to
Details
Statistics
Bibliography
Similar publications
Files
Full Text
2013 - A combinatorial proof of S-adicity for sequences with linear complexity.pdf
Publisher postprint (600.78 kB)
Request a copy
All documents in ORBilu are protected by a
user license
.
Send to
RIS
BibTex
APA
Chicago
Permalink
X
Linkedin
copy to clipboard
copied
Details
Disciplines :
Mathematics
Author, co-author :
Leroy, Julien
;
University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Richomme, Gwenaël
Language :
English
Title :
A combinatorial proof of $S$-adicity for sequences with linear complexity
Publication date :
2013
Journal title :
Integers
ISSN :
1553-1732
Publisher :
Integers, Carrollton, United States - Georgia
Volume :
13
Pages :
Paper No. A5, 19
Peer reviewed :
Peer Reviewed verified by ORBi
Commentary :
3083467
Available on ORBilu :
since 13 January 2014
Statistics
Number of views
45 (2 by Unilu)
Number of downloads
0 (0 by Unilu)
More statistics
Bibliography
Similar publications
Contact ORBilu
