\documentclass[11pt,twoside]{article}
\usepackage{fancyhead}
\usepackage{psfrag}
\usepackage{epsfig}
\usepackage{graphicx}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{subfigure}
\usepackage{cite}
\usepackage[latin1]{inputenc}

\def\ds{\displaystyle}

\newtheorem{definition}{Definition}
\newtheorem{construction}{Construction}
\newtheorem{example}{Example}
\newtheorem{proposition}{Proposition}
\newtheorem{lemma}{Lemma}
\newtheorem{theorem}{Theorem}

\textwidth 132mm \textheight 19cm \evensidemargin 0cm
\oddsidemargin 0cm

\pagestyle{fancyplain} \footrulewidth 0pt \headrulewidth 0.4pt
\lhead[\fancyplain{}{\small\thepage}]{\fancyplain{}{\small\rightmark}}
\rhead[\fancyplain{}{\small\leftmark}]{\fancyplain{}{\small\thepage}}
\lfoot{} \rfoot{} \chead{} \cfoot{}

\pagenumbering{arabic}

\begin{document}


\vspace*{5mm}

\noindent
%%--The title should be placed here
\textbf{\LARGE Title
%%--If you do not use any support, just comment the next line or delete it.
}
\thispagestyle{fancyplain} \setlength\partopsep {0pt} \flushbottom
\date{}

\vspace*{5mm}
\noindent
%%--The name(s) of the author(s), their e-mails and addresses should be placed here
\textsc{Author1\footnote{This research of this author was partially supported by ...}} \hfill \texttt{user1@host1.aa} \\
{\small Affiliation1} \\
\textsc{Author2} \hfill \texttt{user2@host2.aa} \\
{\small Affiliation2} \\
\textsc{Author3, Author4} \hfill \texttt{\{user3,user4\}@host3.aa} \\
{\small Affiliation3}


\medskip

\begin{center}
\parbox{11,8cm}{\footnotesize
%%--The abstract goes here.
\textbf{Abstract.} In this paper we do something.
}
\end{center}

\baselineskip=0.9\normalbaselineskip

\section{Introduction}

\lhead{} \rhead{}
\chead[\fancyplain{}{\small\sl\leftmark}]{\fancyplain{}{\small\sl
\leftmark}} \markboth{\hspace{-2,15cm}Eighth International Workshop
on Optimal Codes and Related Topics\\ July 10-14, 2017, Sofia, Bulgaria \hfill pp. xxx-xxx}{}

An introductory part goes here.

\newpage

\section{Section title}

This section is the next, but might be not the last one.

\begin{lemma}
The lemma statement.
\end{lemma}

\begin{proof}
The proof of the lemma goes here.
\begin{equation}
n!=1\cdot2\cdot\ldots\cdot(n-1)\cdot n
\end{equation}

The end of the proof.
\end{proof}

Here it might be written something else.

\pagestyle{myheadings} \markboth{OC2013}{Author(s)}

\begin{theorem}
If ..., then something is true.
\end{theorem}
\begin{proof}
\end{proof}

\begin{thebibliography}{99}
%examples

%book
\bibitem{MWS79}
  F.\,J.~MacWilliams and N.\,J.\,A.~Sloane,
  \emph{The Theory of Error-Correcting Codes,} North-Holland, Amsterdam, 1977.

%proceedings
\bibitem{AS98}
  S.\,V.~Avgustinovich and F.\,I.~Solov'eva, Perfect Binary Codes with Trivial Automorphism Group,
  in \emph{Proc. Int. Workshop on Inform. Theory, Killarney, Ireland, 1998,} IEEE, Piscataway, 1998, 114-115.

%journal
\bibitem{Lin69}
  B.~Lindstr\"{o}m, On Group and Nongroup Perfect Codes in $q$ Symbols,
  \emph{Math. Scand.,} \textbf{25}, 149-158, 1969.

\end{thebibliography}

\end{document}               % End of document
