Search dblp for Publications

export results for "toc:db/journals/dcc/dcc53.bht:"

 download as .bib file

@article{DBLP:journals/dcc/AldersonG09,
  author       = {T. L. Alderson and
                  Andr{\'{a}}s G{\'{a}}cs},
  title        = {On the maximality of linear codes},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {1},
  pages        = {59--68},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9293-z},
  doi          = {10.1007/S10623-009-9293-Z},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/AldersonG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/BallF09,
  author       = {Simeon Ball and
                  Szabolcs L. Fancsali},
  title        = {Multiple blocking sets in finite projective spaces and improvements
                  to the Griesmer bound for linear codes},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {2},
  pages        = {119--136},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9298-7},
  doi          = {10.1007/S10623-009-9298-7},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcc/BallF09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/Bras-Amoros09,
  author       = {Maria Bras{-}Amor{\'{o}}s},
  title        = {On numerical semigroups and the redundancy of improved codes correcting
                  generic errors},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {2},
  pages        = {111--118},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9297-8},
  doi          = {10.1007/S10623-009-9297-8},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Bras-Amoros09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/CarvalhoS09,
  author       = {C{\'{\i}}cero Carvalho and
                  Ercilio da Silva},
  title        = {On algebras admitting a complete set of near weights, evaluation codes,
                  and Goppa codes},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {2},
  pages        = {99--110},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9296-9},
  doi          = {10.1007/S10623-009-9296-9},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/CarvalhoS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/CoulterG09,
  author       = {Robert S. Coulter and
                  Todd Gutekunst},
  title        = {Special subsets of difference sets with particular emphasis on skew
                  Hadamard difference sets},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {1},
  pages        = {1--12},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9288-9},
  doi          = {10.1007/S10623-009-9288-9},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/CoulterG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/Csirmaz09,
  author       = {L{\'{a}}szl{\'{o}} Csirmaz},
  title        = {An impossibility result on graph secret sharing},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {3},
  pages        = {195--209},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9304-0},
  doi          = {10.1007/S10623-009-9304-0},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Csirmaz09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/FanaliG09,
  author       = {Stefania Fanali and
                  Massimo Giulietti},
  title        = {On maximal curves with Frobenius dimension 3},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {3},
  pages        = {165--174},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9302-2},
  doi          = {10.1007/S10623-009-9302-2},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/FanaliG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/Heden09,
  author       = {Olof Heden},
  title        = {Necessary and sufficient conditions for the existence of a class of
                  partitions of a finite vector space},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {2},
  pages        = {69--73},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9292-0},
  doi          = {10.1007/S10623-009-9292-0},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Heden09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/Kavuluru09,
  author       = {Ramakanth Kavuluru},
  title        = {Characterization of 2\({}^{\mbox{\emph{n}}}\)-periodic binary sequences
                  with fixed 2-error or 3-error linear complexity},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {2},
  pages        = {75--97},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9295-x},
  doi          = {10.1007/S10623-009-9295-X},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Kavuluru09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/Mossinghoff09,
  author       = {Michael J. Mossinghoff},
  title        = {Wieferich pairs and Barker sequences},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {3},
  pages        = {149--163},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9301-3},
  doi          = {10.1007/S10623-009-9301-3},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/Mossinghoff09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/OwsiejczukP09,
  author       = {Andrzej Owsiejczuk and
                  Malgorzata Prazmowska},
  title        = {Combinatorial generalizations of generalized quadrangles of order
                  (2, 2)},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {1},
  pages        = {45--57},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9291-1},
  doi          = {10.1007/S10623-009-9291-1},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/OwsiejczukP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/PintoSMA09,
  author       = {Alexandre Pinto and
                  Andre Souto and
                  Armando Matos and
                  Luis Filipe Coelho Antunes},
  title        = {Commitment and authentication systems},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {3},
  pages        = {175--193},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9303-1},
  doi          = {10.1007/S10623-009-9303-1},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/PintoSMA09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/RoyS09,
  author       = {Aidan Roy and
                  A. J. Scott},
  title        = {Unitary designs and codes},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {1},
  pages        = {13--31},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9290-2},
  doi          = {10.1007/S10623-009-9290-2},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/RoyS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/TangHF09,
  author       = {Xiaohu Tang and
                  Tor Helleseth and
                  Pingzhi Fan},
  title        = {A new optimal quaternary sequence family of length 2(2\({}^{\mbox{\emph{n}}}\)
                  - 1) obtained from the orthogonal transformation of Families \emph{B}
                  and \emph{C}},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {3},
  pages        = {137--148},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9294-y},
  doi          = {10.1007/S10623-009-9294-Y},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/TangHF09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcc/YangQ09,
  author       = {Siman Yang and
                  Lulu Qi},
  title        = {On improved asymptotic bounds for codes from global function fields},
  journal      = {Des. Codes Cryptogr.},
  volume       = {53},
  number       = {1},
  pages        = {33--43},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10623-009-9289-8},
  doi          = {10.1007/S10623-009-9289-8},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcc/YangQ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.