default search action

combined dblp search
author search
venue search
publication search

ask others

Ruslan Alexandrovich Morozov

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2020
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/Morozov20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/Morozov20
Ruslan Alexandrovich Morozov:
Convolutional Polar Kernels. IEEE Trans. Commun. 68(12): 7352-7361 (2020)
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2007-05811
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2007-05811
Ruslan Alexandrovich Morozov:
Efficient List Decoding of Convolutional Polar Codes. CoRR abs/2007.05811 (2020)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2008-11611
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2008-11611
Ruslan Alexandrovich Morozov:
Convolutional Polar Kernels. CoRR abs/2008.11611 (2020)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2019
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tcom/MorozovT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcom/MorozovT19
Ruslan Alexandrovich Morozov, Peter Trifonov:
On Distance Properties of Convolutional Polar Codes. IEEE Trans. Commun. 67(7): 4585-4592 (2019)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/wcl/MorozovT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/wcl/MorozovT19
Ruslan Alexandrovich Morozov, Peter Trifonov:
Successive and Two-Stage Systematic Encoding of Polar Subcodes. IEEE Wirel. Commun. Lett. 8(3): 877-880 (2019)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/MorozovT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/MorozovT19
Ruslan Alexandrovich Morozov, Peter Trifonov:
A Lower Bound on Minimum Distance of Convolutional Polar Codes. ISIT 2019: 2104-2108
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/redundancy/Morozov19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/redundancy/Morozov19
Ruslan Alexandrovich Morozov:
A Simplified Lower Bound on Minimum Distance of Convolutional Polar Codes. REDUNDANCY 2019: 7-11
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1901-06341
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1901-06341
Ruslan Alexandrovich Morozov, Peter Trifonov:
On Distance Properties of Convolutional Polar Codes. CoRR abs/1901.06341 (2019)
2018
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/isita/MorozovT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isita/MorozovT18
Ruslan Alexandrovich Morozov, Peter Trifonov:
Efficient SC Decoding of Convolutional Polar Codes. ISITA 2018: 442-446
2017
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/TrifonovMM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/TrifonovMM17
Peter Trifonov, Vera Miloslavskaya, Ruslan Alexandrovich Morozov:
Fast Sequential Decoding of Polar Codes. CoRR abs/1703.06592 (2017)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.