Remove rename_keyword deprecation warning (6 years old)

Author: johanrosenkilde

src/sage/coding/code_bounds.py

@@ -174,11 +174,9 @@
 from sage.arith.misc import is_prime_power
 from sage.arith.all import factorial
 from sage.functions.all import log, sqrt
-from sage.misc.decorators import rename_keyword
 from .delsarte_bounds import delsarte_bound_hamming_space, \
                 delsarte_bound_additive_hamming_space
 
-@rename_keyword(deprecation=6094, method="algorithm")
 def codesize_upper_bound(n,d,q,algorithm=None):
     r"""
     Returns an upper bound on the code size.
@@ -237,7 +235,6 @@ def codesize_upper_bound(n,d,q,algorithm=None):
         sub = singleton_upper_bound(n,q,d)
         return min([eub,hub,pub,sub])
 
-@rename_keyword(deprecation=6094, method="algorithm")
 def dimension_upper_bound(n,d,q,algorithm=None):
     r"""
     Returns an upper bound for the dimension of a linear code.
@@ -296,7 +293,6 @@ def gilbert_lower_bound(n,q,d):
     ans=q**n/volume_hamming(n,q,d-1)
     return ans
 
-@rename_keyword(deprecation=6094, method="algorithm")
 def plotkin_upper_bound(n,q,d, algorithm=None):
     r"""
     Returns Plotkin upper bound.
@@ -332,7 +328,6 @@ def plotkin_upper_bound(n,q,d, algorithm=None):
                 fact = int(fact) + 1
             return int(d/( d - t * fact)) * q**(n - fact)
 
-@rename_keyword(deprecation=6094, method="algorithm")
 def griesmer_upper_bound(n,q,d,algorithm=None):
     r"""
     Returns the Griesmer upper bound.
@@ -393,7 +388,6 @@ def griesmer_upper_bound(n,q,d,algorithm=None):
         return 0
 
 
-@rename_keyword(deprecation=6094, method="algorithm")
 def elias_upper_bound(n,q,d,algorithm=None):
     r"""
     Returns the Elias upper bound.