default search action

combined dblp search
author search
venue search
publication search

ask others

Thomas Blackford

Jason Thomas Blackford – J. Thomas Blackford

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

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

2020
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/amco/TabueMB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amco/TabueMB20
Alexandre Fotue Tabue, Edgar Martínez-Moro, J. Thomas Blackford:
On polycyclic codes over a finite chain ring. Adv. Math. Commun. 14(3): 455-466 (2020)
2017
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/ffa/Blackford17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ffa/Blackford17
Thomas Blackford:
The Galois variance of constacyclic codes. Finite Fields Their Appl. 47: 286-308 (2017)
2013
[j7]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/ffa/Blackford13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ffa/Blackford13
Thomas Blackford:
Isodual constacyclic codes. Finite Fields Their Appl. 24: 29-44 (2013)
2008
[j6]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/ffa/Blackford08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ffa/Blackford08
Thomas Blackford:
Negacyclic duadic codes. Finite Fields Their Appl. 14(4): 930-943 (2008)
2003
[j5]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Blackford03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Blackford03
Thomas Blackford:
Cyclic Codes Over Z₄ of Oddly Even Length. Discret. Appl. Math. 128(1): 27-46 (2003)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/Blackford03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/Blackford03
Thomas Blackford:
Negacyclic codes over Z₄ of even length. IEEE Trans. Inf. Theory 49(6): 1417-1424 (2003)
2002
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/LingB02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/LingB02
San Ling, Jason Thomas Blackford:
Z_pk+1-Linear codes. IEEE Trans. Inf. Theory 48(9): 2592-2605 (2002)
2001
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/Blackford01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Blackford01
Thomas Blackford:
Cyclic Codes over Z₄ of Oddly Even Length. Electron. Notes Discret. Math. 6: 528-537 (2001)
2000
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/BlackfordR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/BlackfordR00
Jason Thomas Blackford, Dwijendra K. Ray-Chaudhuri:
A transform approach to permutation groups of cyclic codes over Galois rings. IEEE Trans. Inf. Theory 46(7): 2350-2358 (2000)

Informal and Other Publications

see FAQ

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

2018
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1811-07975
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-07975
Edgar Martínez-Moro, Alexandre Fotue Tabue, Thomas Blackford:
On polycyclic codes over a finite chain ring. CoRR abs/1811.07975 (2018)

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.