Some Algebraic Aspects of Morse Code SequencesCigler, JohannAlain MonteilISSN: 1365-8050Discrete Mathematics & Theoretical Computer ScienceEpisciences.orghttps://dmtcs.episciences.org/334info:doi:10.46298/dmtcs.334dmtcs:334 - Discrete Mathematics & Theoretical Computer Science, 2003-01-01, Vol. 6 no. 1enFibonacci polynomialq-analogueq-binomial coefficient[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]info:eu-repo/semantics/openAccessinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articleJournal articlesinfo:eu-repo/semantics/publishedVersionResearchersMorse code sequences are very useful to give combinatorial interpretations of various properties of Fibonacci numbers. In this note we study some algebraic and combinatorial aspects of Morse code sequences and obtain several q-analogues of Fibonacci numbers and Fibonacci polynomials and their generalizations.2003-01-01